[Namespaces changes]
vert->vertex clean up of some namespaces to comply the following naming: Complexes (3 letters namespaces): order 0 (point cloud ) :vrt order 1 (edge meshes) :edg order 2 (triangle meshes) :tri order 3 (triangle meshes) :tet Simplexes (extended namespaces): order 0 (vertex) :vertex order 1 (edge) :edge order 2 (triangle) :triangle (temporarily it remains "face") order 3 (tetrahedron) :tetrahedron
This commit is contained in:
parent
bb741600ca
commit
e16d065e93
|
@ -247,7 +247,7 @@ namespace vcg {
|
|||
typedef VertTmark<MESH> MarkerVert;
|
||||
MarkerVert mv;
|
||||
mv.SetMesh(&mesh);
|
||||
typedef vcg::vert::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
typedef vcg::vertex::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
VDistFunct fn;
|
||||
_minDist=_maxDist;
|
||||
Point3x _closestPt;
|
||||
|
@ -263,7 +263,7 @@ namespace vcg {
|
|||
typedef VertTmark<MESH> MarkerVert;
|
||||
MarkerVert mv;
|
||||
mv.SetMesh(&mesh);
|
||||
typedef vcg::vert::PointNormalDistanceFunctor<typename MESH::VertexType> VDistFunct;
|
||||
typedef vcg::vertex::PointNormalDistanceFunctor<typename MESH::VertexType> VDistFunct;
|
||||
VDistFunct fn;
|
||||
_minDist=_maxDist;
|
||||
Point3x _closestPt;
|
||||
|
@ -291,7 +291,7 @@ namespace vcg {
|
|||
typedef VertTmark<MESH> MarkerVert;
|
||||
MarkerVert mv;
|
||||
mv.SetMesh(&mesh);
|
||||
typedef vcg::vert::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
typedef vcg::vertex::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
VDistFunct distFunct;
|
||||
return (gr.GetKClosest/* <VDistFunct,MarkerVert,OBJPTRCONTAINER,DISTCONTAINER,POINTCONTAINER>*/
|
||||
(distFunct,mv,_k,_p,_maxDist,_objectPtrs,_distances,_points));
|
||||
|
@ -326,7 +326,7 @@ namespace vcg {
|
|||
typedef VertTmark<MESH> MarkerVert;
|
||||
MarkerVert mv;
|
||||
mv.SetMesh(&mesh);
|
||||
typedef vcg::vert::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
typedef vcg::vertex::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
VDistFunct fn;
|
||||
return (gr.GetInSphere/*<VDistFunct,MarkerVert,OBJPTRCONTAINER,DISTCONTAINER,POINTCONTAINER>*/
|
||||
(fn, mv,_p,_r,_objectPtrs,_distances,_points));
|
||||
|
@ -424,13 +424,13 @@ namespace vcg {
|
|||
};
|
||||
|
||||
template <class GRID,class MESH>
|
||||
class ClosestVertexIterator:public vcg::ClosestIterator<GRID, vcg::vert::PointDistanceFunctor<typename MESH::ScalarType>, VertTmark<MESH> >
|
||||
class ClosestVertexIterator:public vcg::ClosestIterator<GRID, vcg::vertex::PointDistanceFunctor<typename MESH::ScalarType>, VertTmark<MESH> >
|
||||
{
|
||||
public:
|
||||
typedef GRID GridType;
|
||||
typedef MESH MeshType;
|
||||
typedef VertTmark<MESH> MarkerVert;
|
||||
typedef vcg::vert::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
typedef vcg::vertex::PointDistanceFunctor<typename MESH::ScalarType> VDistFunct;
|
||||
typedef vcg::ClosestIterator<GRID, VDistFunct, VertTmark<MESH> > ClosestBaseType;
|
||||
VDistFunct fn;
|
||||
ClosestVertexIterator(GridType &_Si):ClosestBaseType(_Si,fn){}
|
||||
|
|
|
@ -75,4 +75,4 @@ public:
|
|||
} // end namespace vcg
|
||||
|
||||
|
||||
#endif
|
||||
#endif
|
||||
|
|
|
@ -557,14 +557,14 @@ namespace tri
|
|||
template < class, class > class TriMesh;
|
||||
|
||||
template < class VertexType, class FaceContainerType >
|
||||
bool HasPerVertexQuality (const TriMesh < vert::vector_ocf< VertexType > , FaceContainerType > & m)
|
||||
bool HasPerVertexQuality (const TriMesh < vertex::vector_ocf< VertexType > , FaceContainerType > & m)
|
||||
{
|
||||
if(VertexType::HasQualityOcf()) return m.vert.IsQualityEnabled();
|
||||
else return VertexType::HasQuality();
|
||||
}
|
||||
|
||||
template < class VertexType >
|
||||
void ReorderVert( std::vector<size_t> &newVertIndex, vert::vector_ocf< VertexType > &vertVec)
|
||||
void ReorderVert( std::vector<size_t> &newVertIndex, vertex::vector_ocf< VertexType > &vertVec)
|
||||
{
|
||||
vertVec.ReorderVert(newVertIndex);
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue