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

Added two methods for point cloud smoothing of quality (median and average)

This commit is contained in:
Paolo Cignoni 2016-01-30 23:08:17 +00:00
parent 3330625ba6
commit e8c27766a7
1 changed files with 44 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -628,6 +628,50 @@ public:
int cnt;
};
static void PointCloudQualityAverage(MeshType &m, int neighbourSize=8, int iter=1)
{
tri::RequireCompactness(m);
VertexConstDataWrapper<MeshType> ww(m);
KdTree<ScalarType> kt(ww);
typename KdTree<ScalarType>::PriorityQueue pq;
for(int k=0;k<iter;++k)
{
std::vector<ScalarType> newQVec(m.vn);
for(int i=0;i<m.vn;++i)
{
kt.doQueryK(m.vert[i].P(),neighbourSize,pq);
float qAvg=0;
for(int j=0;j<pq.getNofElements();++j)
qAvg+= m.vert[pq.getIndex(j)].Q();
newQVec[i]=qAvg/float(pq.getNofElements());
}
for(int i=0;i<m.vn;++i)
m.vert[i].Q() = newQVec[i];
}
}
static void PointCloudQualityMedian(MeshType &m, int medianSize=8)
{
tri::RequireCompactness(m);
VertexConstDataWrapper<MeshType> ww(m);
KdTree<ScalarType> kt(ww);
typename KdTree<ScalarType>::PriorityQueue pq;
std::vector<ScalarType> newQVec(m.vn);
for(int i=0;i<m.vn;++i)
{
kt.doQueryK(m.vert[i].P(),medianSize,pq);
std::vector<ScalarType> qVec(pq.getNofElements());
for(int j=0;j<pq.getNofElements();++j)
qVec[j]=m.vert[pq.getIndex(j)].Q();
std::sort(qVec.begin(),qVec.end());
newQVec[i]=qVec[qVec.size()/2];
}
for(int i=0;i<m.vn;++i)
m.vert[i].Q() = newQVec[i];
}
static void VertexQualityLaplacian(MeshType &m, int step=1, bool SmoothSelected=false)
{