manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added VertexNormalPointCloud to smooth the normals of a point cloud by using the kdtree instead of the octree...

This commit is contained in:
Paolo Cignoni 2012-11-07 22:49:46 +00:00
parent 57adeea537
commit e88379c8c6
1 changed files with 24 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
vcg/complex/algorithms/smooth.h
View File

@ -33,6 +33,7 @@
#include <vcg/complex/algorithms/update/normal.h>
#include <vcg/complex/algorithms/update/halfedge_topology.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/space/index/kdtree/kdtree.h>
namespace vcg
@ -1231,6 +1232,29 @@ static void VertexCoordPasoDobleFast(MeshType &m, int NormalSmoothStep, typename
FastFitMesh(m,TDV,SmoothSelected);
}
static void VertexNormalPointCloud(MeshType &m, int neighborNum)
{
SimpleTempData<typename MeshType::VertContainer,Point3f > TD(m.vert,Point3f(0,0,0));
VertexConstDataWrapper<MeshType> ww(m);
KdTree<float> tree(ww);
tree.setMaxNofNeighbors(neighborNum);
for (VertexIterator vi = m.vert.begin();vi!=m.vert.end();++vi)
{
tree.doQueryK(vi->cP());
int neighbours = tree.getNofFoundNeighbors();
for (int i = 0; i < neighbours; i++)
{
int neightId = tree.getNeighborId(i);
TD[vi]+= m.vert[neightId].cN();
}
}
for (VertexIterator vi = m.vert.begin();vi!=m.vert.end();++vi)
vi->N()=TD[vi];
tri::UpdateNormal<MeshType>::NormalizePerVertex(m);
}
//! Laplacian smoothing with a reprojection on a target surface.
// grid must be a spatial index that contains all triangular faces of the target mesh gridmesh
template<class GRID, class MeshTypeTri>