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

Othography. Fartest -> Farthest

This commit is contained in:
Paolo Cignoni 2008-12-21 07:44:29 +00:00
parent 190e1612c7
commit 56d93a02b6
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
vcg/complex/trimesh/geodesic.h
View File

@ -154,7 +154,7 @@ class Geo{
MeshType & m, MeshType & m,
std::vector<VertDist> & _frontier, std::vector<VertDist> & _frontier,
ScalarType & max_distance, ScalarType & max_distance,
bool fartestOnBorder = false bool farthestOnBorder = false
) )
{ {
bool isLeaf,toQueue; bool isLeaf,toQueue;
@ -214,7 +214,7 @@ class Geo{
(*TD)[curr].visited = true; (*TD)[curr].visited = true;
isLeaf = (!fartestOnBorder || curr->IsB()); isLeaf = (!farthestOnBorder || curr->IsB());
face::VFIterator<FaceType> x;int k; face::VFIterator<FaceType> x;int k;
@ -333,7 +333,7 @@ public:
distance from the cloasest source to all the mesh vertices and returns the pointer to the farthest. distance from the cloasest source to all the mesh vertices and returns the pointer to the farthest.
Note: update the field Q() of the vertices Note: update the field Q() of the vertices
*/ */
static void FartestVertex( MeshType & m, static void FarthestVertex( MeshType & m,
std::vector<VertexPointer> & fro, std::vector<VertexPointer> & fro,
VertexPointer & farthest, VertexPointer & farthest,
ScalarType & distance){ ScalarType & distance){
@ -350,22 +350,22 @@ public:
distance from the vertex-source to all the mesh vertices and returns the pointer to the farthest distance from the vertex-source to all the mesh vertices and returns the pointer to the farthest
Note: update the field Q() of the vertices Note: update the field Q() of the vertices
*/ */
static void FartestVertex( MeshType & m, static void FarthestVertex( MeshType & m,
VertexPointer seed, VertexPointer seed,
VertexPointer & farthest, VertexPointer & farthest,
ScalarType & distance){ ScalarType & distance){
std::vector<VertexPointer> fro; std::vector<VertexPointer> fro;
fro.push_back( seed ); fro.push_back( seed );
VertexPointer v0; VertexPointer v0;
FartestVertex(m,fro,v0,distance); FarthestVertex(m,fro,v0,distance);
farthest = v0; farthest = v0;
} }
/* /*
Same as FartestPoint but the returned pointer is to a border vertex Same as FarthestPoint but the returned pointer is to a border vertex
Note: update the field Q() of the vertices Note: update the field Q() of the vertices
*/ */
static void FartestBVertex(MeshType & m, static void FarthestBVertex(MeshType & m,
std::vector<VertexPointer> & fro, std::vector<VertexPointer> & fro,
VertexPointer & farthest, VertexPointer & farthest,
ScalarType & distance){ ScalarType & distance){
@ -378,17 +378,17 @@ public:
farthest = Visit(m,fr,distance,true); farthest = Visit(m,fr,distance,true);
} }
/* /*
Same as FartestPoint but the returned pointer is to a border vertex Same as FarthestPoint but the returned pointer is to a border vertex
Note: update the field Q() of the vertices Note: update the field Q() of the vertices
*/ */
static void FartestBVertex( MeshType & m, static void FarthestBVertex( MeshType & m,
VertexPointer seed, VertexPointer seed,
VertexPointer & farthest, VertexPointer & farthest,
ScalarType & distance){ ScalarType & distance){
std::vector<VertexPointer> fro; std::vector<VertexPointer> fro;
fro.push_back( seed ); fro.push_back( seed );
VertexPointer v0; VertexPointer v0;
FartestBVertex(m,fro,v0,distance); FarthestBVertex(m,fro,v0,distance);
farthest = v0; farthest = v0;
} }
@ -405,7 +405,7 @@ public:
for(vi = m.vert.begin(); vi != m.vert.end(); ++vi) for(vi = m.vert.begin(); vi != m.vert.end(); ++vi)
if( (*vi).IsB()) if( (*vi).IsB())
fro.push_back(&(*vi)); fro.push_back(&(*vi));
FartestVertex(m,fro,farthest,distance); FarthestVertex(m,fro,farthest,distance);
} }
}; };