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

CHANGE to the VERY USED PointDistanceBase, the basic functor used to find the closest point to a face in all the grids. 

It has a bug that could return a nan in some degnerate case where an almost null face has different vertices but the squared distance between them could be zero. 
Now it should handle also these cases.
This commit is contained in:
Paolo Cignoni 2012-03-14 15:59:42 +00:00
parent b57a747441
commit f58551601a
1 changed files with 20 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
vcg/simplex/face/distance.h
View File

@ -319,22 +319,26 @@ namespace vcg {
assert((f.cN().SquaredNorm() ==0) || (f.cN().SquaredNorm() > 0.9999 && f.cN().SquaredNorm()<1.0001)); // if you get this assert you have forgot to make a UpdateNormals::PerFaceNormalized(m)
#endif
if(f.cN()==Point3<ScalarType>(0,0,0)) // to correctly manage the case of degenerate triangles we consider them as segments.
{
Box3<ScalarType> bb;
f.GetBBox(bb);
Segment3<ScalarType> degenTri(bb.min,bb.max);
//Point3<ScalarType> closest= ClosestPoint( degenTri, q );
//ScalarType d = Distance(closest, q);
Point3<ScalarType> closest;
ScalarType d;
vcg::SegmentPointDistance<ScalarType>(degenTri,q,closest,d);
if( d>dist || d<-dist ) // Risultato peggiore: niente di fatto
return false;
dist=d;
p=closest;
return true;
}
if(f.cN()==Point3<ScalarType>(0,0,0)) // to correctly manage the case of degenerate triangles we consider them as segments.
{
Box3<ScalarType> bb;
f.GetBBox(bb);
Segment3<ScalarType> degenTri(bb.min,bb.max);
Point3<ScalarType> closest;
ScalarType d;
if(bb.Diag()>0)
vcg::SegmentPointDistance<ScalarType>(degenTri,q,closest,d);
else // very degenerate triangle (just a point)
{
closest = bb.min;
d=Distance(q,closest);
}
if( d>dist) return false;
dist=d;
p=closest;
assert(!math::IsNAN(dist));
return true;
}
Plane3<ScalarType> fPlane;
fPlane.Init(f.cP(0),f.cN());