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

Refactored the ComputeFaceEdgeLengthDistribution function. Now it collects info about the edges also complying fauxedges and polygonal meshes.

This commit is contained in:
Paolo Cignoni 2014-05-13 10:55:53 +00:00
parent db0a706384
commit 5b4357f9bb
1 changed files with 6 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
vcg/complex/algorithms/stat.h
View File

@ -32,6 +32,7 @@
#include <vcg/simplex/face/topology.h>
#include <vcg/complex/algorithms/closest.h>
#include <vcg/space/index/grid_static_ptr.h>
#include <vcg/complex/algorithms/update/topology.h>
namespace vcg {
@ -226,23 +227,14 @@ public:
return h.Avg();
}
static void ComputeFaceEdgeLengthDistribution( MeshType & m, Distribution<float> &h)
static void ComputeFaceEdgeLengthDistribution( MeshType & m, Distribution<float> &h, bool includeFauxEdge=false)
{
tri::RequireTriangularMesh(m);
std::vector< typename tri::UpdateTopology<MeshType>::PEdge > edgeVec;
tri::UpdateTopology<MeshType>::FillUniqueEdgeVector(m,edgeVec,includeFauxEdge);
h.Clear();
tri::UpdateFlags<MeshType>::FaceBorderFromNone(m);
for(FaceIterator fi = m.face.begin(); fi != m.face.end(); ++fi)
{
if(!(*fi).IsD())
{
for(int i=0;i<3;++i)
{
h.Add(Distance<float>(fi->P0(i),fi->P1(i)));
if(fi->IsB(i)) // to be uniform border edges must be added twice...
h.Add(Distance<float>(fi->P0(i),fi->P1(i)));
}
}
}
for(size_t i=0;i<edgeVec.size();++i)
h.Add(Distance(edgeVec[i].v[0]->P(),edgeVec[i].v[1]->P()));
}
static ScalarType ComputeFaceEdgeLengthAverage(MeshType & m)