Ongoing Rearrangement of filpath
renaming of complex/base.h to complex/complex.h
This commit is contained in:
ganovelli
parent
1ad23912db
commit
882896dd8d
|
|
@ -0,0 +1,649 @@
|
|||
/****************************************************************************
|
||||
* VCGLib o o *
|
||||
* Visual and Computer Graphics Library o o *
|
||||
* _ O _ *
|
||||
* Copyright(C) 2004 \/)\/ *
|
||||
* Visual Computing Lab /\/| *
|
||||
* ISTI - Italian National Research Council | *
|
||||
* \ *
|
||||
* All rights reserved. *
|
||||
* *
|
||||
* This program is free software; you can redistribute it and/or modify *
|
||||
* it under the terms of the GNU General Public License as published by *
|
||||
* the Free Software Foundation; either version 2 of the License, or *
|
||||
* (at your option) any later version. *
|
||||
* *
|
||||
* This program is distributed in the hope that it will be useful, *
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
||||
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
||||
* for more details. *
|
||||
* *
|
||||
****************************************************************************/
|
||||
|
||||
#if defined(_MSC_VER)
|
||||
#pragma warning( disable : 4804 )
|
||||
#endif
|
||||
#include <assert.h>
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <set>
|
||||
#include <vcg/space/box3.h>
|
||||
#include <vcg/space/color4.h>
|
||||
#include <vcg/math/shot.h>
|
||||
|
||||
#include <vcg/container/simple_temporary_data.h>
|
||||
#include <vcg/simplex/vertex/base.h>
|
||||
#include <vcg/simplex/edge/base.h>
|
||||
#include <vcg/simplex/face/base.h>
|
||||
#include <vcg/connectors/hedge.h>
|
||||
#include <vcg/complex/used_types.h>
|
||||
#include <vcg/container/derivation_chain.h>
|
||||
|
||||
|
||||
|
||||
#ifndef __VCG_MESH
|
||||
#define __VCG_MESH
|
||||
|
||||
namespace vcg {
|
||||
namespace tri {
|
||||
/** \addtogroup trimesh */
|
||||
/*@{*/
|
||||
/*@{*/
|
||||
/** Class Mesh.
|
||||
This is class for definition of a mesh.
|
||||
@param VertContainerType (Template Parameter) Specifies the type of the vertices container any the vertex type.
|
||||
@param FaceContainer (Template Parameter) Specifies the type of the faces container any the face type.
|
||||
*/
|
||||
|
||||
|
||||
/* MeshTypeHolder is a class which is used to define the types in the mesh
|
||||
*/
|
||||
|
||||
template <class TYPESPOOL>
|
||||
struct BaseMeshTypeHolder{
|
||||
|
||||
typedef bool ScalarType;
|
||||
typedef std::vector< typename TYPESPOOL::VertexType > CONTV;
|
||||
typedef std::vector< typename TYPESPOOL::EdgeType > CONTE;
|
||||
typedef std::vector< typename TYPESPOOL::FaceType > CONTF;
|
||||
typedef std::vector< typename TYPESPOOL::HEdgeType > CONTH;
|
||||
|
||||
typedef CONTV VertContainer;
|
||||
typedef _Vertex VertexType;
|
||||
typedef typename TYPESPOOL::VertexPointer VertexPointer;
|
||||
typedef const typename TYPESPOOL::VertexPointer ConstVertexPointer;
|
||||
typedef bool CoordType;
|
||||
typedef typename CONTV::iterator VertexIterator;
|
||||
typedef typename CONTV::const_iterator ConstVertexIterator;
|
||||
|
||||
typedef CONTE EdgeContainer;
|
||||
typedef typename CONTE::value_type EdgeType;
|
||||
typedef typename TYPESPOOL::EdgePointer EdgePointer;
|
||||
typedef typename CONTE::iterator EdgeIterator;
|
||||
typedef typename CONTE::const_iterator ConstEdgeIterator;
|
||||
|
||||
typedef CONTF FaceContainer;
|
||||
typedef typename CONTF::value_type FaceType;
|
||||
typedef typename CONTF::const_iterator ConstFaceIterator;
|
||||
typedef typename CONTF::iterator FaceIterator;
|
||||
typedef typename TYPESPOOL::FacePointer FacePointer;
|
||||
typedef const typename TYPESPOOL::FacePointer ConstFacePointer;
|
||||
|
||||
typedef CONTH HEdgeContainer;
|
||||
typedef typename CONTH::value_type HEdgeType;
|
||||
typedef typename TYPESPOOL::HEdgePointer HEdgePointer;
|
||||
typedef typename CONTH::iterator HEdgeIterator;
|
||||
typedef typename CONTH::const_iterator ConstHEdgeIterator;
|
||||
|
||||
|
||||
};
|
||||
|
||||
|
||||
|
||||
template <class T, typename CONT, class TRAIT >
|
||||
struct MeshTypeHolder: public T {};
|
||||
|
||||
template <class T, typename CONT>
|
||||
struct MeshTypeHolder<T, CONT, AllTypes::AVertexType>: public T {
|
||||
typedef CONT VertContainer;
|
||||
typedef typename VertContainer::value_type VertexType;
|
||||
typedef VertexType * VertexPointer;
|
||||
typedef const VertexType * ConstVertexPointer;
|
||||
typedef typename VertexType::ScalarType ScalarType;
|
||||
typedef typename VertexType::CoordType CoordType;
|
||||
typedef typename VertContainer::iterator VertexIterator;
|
||||
typedef typename VertContainer::const_iterator ConstVertexIterator;
|
||||
};
|
||||
|
||||
|
||||
template <typename T, class CONT>
|
||||
struct MeshTypeHolder< T, CONT, AllTypes::AEdgeType>: public T{
|
||||
typedef CONT EdgeContainer;
|
||||
typedef typename EdgeContainer::value_type EdgeType;
|
||||
typedef typename EdgeContainer::value_type * EdgePointer;
|
||||
typedef typename EdgeContainer::iterator EdgeIterator;
|
||||
typedef typename EdgeContainer::const_iterator ConstEdgeIterator;
|
||||
};
|
||||
|
||||
template <typename T, class CONT>
|
||||
struct MeshTypeHolder< T, CONT, AllTypes::AFaceType>:public T {
|
||||
typedef CONT FaceContainer;
|
||||
typedef typename FaceContainer::value_type FaceType;
|
||||
typedef typename FaceContainer::const_iterator ConstFaceIterator;
|
||||
typedef typename FaceContainer::iterator FaceIterator;
|
||||
typedef FaceType * FacePointer;
|
||||
typedef const FaceType * ConstFacePointer;
|
||||
};
|
||||
|
||||
template <typename T, class CONT>
|
||||
struct MeshTypeHolder< T, CONT, AllTypes::AHEdgeType>: public T{
|
||||
typedef CONT HEdgeContainer;
|
||||
typedef typename HEdgeContainer::value_type HEdgeType;
|
||||
typedef typename HEdgeContainer::value_type * HEdgePointer;
|
||||
typedef typename HEdgeContainer::iterator HEdgeIterator;
|
||||
typedef typename HEdgeContainer::const_iterator ConstHEdgeIterator;
|
||||
};
|
||||
|
||||
|
||||
/*struct DummyContainer {};
|
||||
template <class CONT> struct Deriver: public MeshTypeHolder<CONT, typename CONT::value_type::IAm>{};
|
||||
template <> struct Deriver<DummyContainer>{}*/;
|
||||
|
||||
template <typename T, typename CONT> struct Der: public MeshTypeHolder<T,CONT, typename CONT::value_type::IAm>{};
|
||||
struct DummyContainer{struct value_type{ typedef int IAm;}; };
|
||||
|
||||
template < class Container0 = DummyContainer, class Container1 = DummyContainer, class Container2 = DummyContainer, class Container3 = DummyContainer >
|
||||
class TriMesh
|
||||
: public MArity4< BaseMeshTypeHolder<typename Container0::value_type::TypesPool>, Container0, Der ,Container1, Der, Container2, Der, Container3, Der>{
|
||||
public:
|
||||
|
||||
typedef typename TriMesh::ScalarType ScalarType;
|
||||
typedef typename TriMesh::VertContainer VertContainer;
|
||||
typedef typename TriMesh::EdgeContainer EdgeContainer;
|
||||
typedef typename TriMesh::FaceContainer FaceContainer;
|
||||
|
||||
// types for vertex
|
||||
typedef typename TriMesh::VertexType VertexType;
|
||||
typedef typename TriMesh::VertexPointer VertexPointer;
|
||||
typedef typename TriMesh::ConstVertexPointer ConstVertexPointer;
|
||||
typedef typename TriMesh::CoordType CoordType;
|
||||
typedef typename TriMesh::VertexIterator VertexIterator;
|
||||
typedef typename TriMesh::ConstVertexIterator ConstVertexIterator;
|
||||
|
||||
// types for edge
|
||||
typedef typename TriMesh::EdgeType EdgeType;
|
||||
typedef typename TriMesh::EdgePointer EdgePointer;
|
||||
typedef typename TriMesh::EdgeIterator EdgeIterator;
|
||||
typedef typename TriMesh::ConstEdgeIterator ConstEdgeIterator;
|
||||
|
||||
//types for face
|
||||
typedef typename TriMesh::FaceType FaceType;
|
||||
typedef typename TriMesh::ConstFaceIterator ConstFaceIterator;
|
||||
typedef typename TriMesh::FaceIterator FaceIterator;
|
||||
typedef typename TriMesh::FacePointer FacePointer;
|
||||
typedef typename TriMesh::ConstFacePointer ConstFacePointer;
|
||||
|
||||
// types for hedge
|
||||
typedef typename TriMesh::HEdgeType HEdgeType;
|
||||
typedef typename TriMesh::HEdgePointer HEdgePointer;
|
||||
typedef typename TriMesh::HEdgeIterator HEdgeIterator;
|
||||
typedef typename TriMesh::HEdgeContainer HEdgeContainer;
|
||||
typedef typename TriMesh::ConstHEdgeIterator ConstHEdgeIterator;
|
||||
|
||||
typedef TriMesh<Container0, Container1,Container2,Container3> MeshType;
|
||||
|
||||
typedef Box3<ScalarType> BoxType;
|
||||
|
||||
/// Set of vertices
|
||||
VertContainer vert;
|
||||
/// Actual number of vertices
|
||||
int vn;
|
||||
/// Set of faces
|
||||
FaceContainer face;
|
||||
/// Actual number of faces
|
||||
int fn;
|
||||
/// Set of edges
|
||||
EdgeContainer edge;
|
||||
/// Actual number of edges
|
||||
int en;
|
||||
/// Set of hedges
|
||||
HEdgeContainer hedge;
|
||||
/// Actual number of hedges
|
||||
int hn;
|
||||
/// Bounding box of the mesh
|
||||
Box3<ScalarType> bbox;
|
||||
|
||||
/// Nomi di textures
|
||||
//
|
||||
std::vector<std::string> textures;
|
||||
//
|
||||
std::vector<std::string> normalmaps;
|
||||
|
||||
int attrn; // total numer of attribute created
|
||||
|
||||
class PointerToAttribute{
|
||||
public:
|
||||
void * _handle; // pointer to the SimpleTempData that stores the attribute
|
||||
std::string _name; // name of the attribute
|
||||
std::string _typename; // name as returned by the rtti
|
||||
int _sizeof; // size of the attribute type (used only with VMI loading)
|
||||
int _padding; // padding (used only with VMI loading)
|
||||
|
||||
int n_attr; // unique ID of the attribute
|
||||
void Resize(const int & sz){((SimpleTempDataBase<VertContainer>*)_handle)->Resize(sz);}
|
||||
void Reorder(std::vector<size_t> & newVertIndex){((SimpleTempDataBase<VertContainer>*)_handle)->Reorder(newVertIndex);}
|
||||
bool operator<(const PointerToAttribute b) const { return(_name.empty()&&b._name.empty())?(_handle < b._handle):( _name < b._name);}
|
||||
};
|
||||
|
||||
std::set< PointerToAttribute > vert_attr;
|
||||
std::set< PointerToAttribute > edge_attr;
|
||||
std::set< PointerToAttribute > face_attr;
|
||||
std::set< PointerToAttribute > mesh_attr;
|
||||
|
||||
|
||||
template <class ATTR_TYPE, class CONT>
|
||||
class AttributeHandle{
|
||||
public:
|
||||
AttributeHandle(){_handle=(SimpleTempData<CONT,ATTR_TYPE> *)NULL;}
|
||||
AttributeHandle( void *ah,const int & n):_handle ( (SimpleTempData<CONT,ATTR_TYPE> *)ah ),n_attr(n){}
|
||||
AttributeHandle operator = ( const CONT & pva){
|
||||
_handle = (SimpleTempData<CONT,ATTR_TYPE> *)pva._handle;
|
||||
n_attr = pva.n_attr;
|
||||
return (*this);
|
||||
}
|
||||
|
||||
//pointer to the SimpleTempData that stores the attribute
|
||||
SimpleTempData<CONT,ATTR_TYPE> * _handle;
|
||||
|
||||
// its attribute number
|
||||
int n_attr;
|
||||
|
||||
// access function
|
||||
template <class RefType>
|
||||
ATTR_TYPE & operator [](const RefType & i){return (*_handle)[i];}
|
||||
};
|
||||
|
||||
template <class ATTR_TYPE>
|
||||
class PerVertexAttributeHandle: public AttributeHandle<ATTR_TYPE,VertContainer>{
|
||||
public:
|
||||
PerVertexAttributeHandle():AttributeHandle<ATTR_TYPE,VertContainer>(){}
|
||||
PerVertexAttributeHandle( void *ah,const int & n):AttributeHandle<ATTR_TYPE,VertContainer>(ah,n){};
|
||||
};
|
||||
|
||||
template <class ATTR_TYPE>
|
||||
class PerFaceAttributeHandle: public AttributeHandle<ATTR_TYPE,FaceContainer>{
|
||||
public:
|
||||
PerFaceAttributeHandle():AttributeHandle<ATTR_TYPE,FaceContainer>(){}
|
||||
PerFaceAttributeHandle( void *ah,const int & n):AttributeHandle<ATTR_TYPE,FaceContainer>(ah,n){};
|
||||
};
|
||||
|
||||
template <class ATTR_TYPE>
|
||||
class PerEdgeAttributeHandle: public AttributeHandle<ATTR_TYPE,EdgeContainer>{
|
||||
public:
|
||||
PerEdgeAttributeHandle():AttributeHandle<ATTR_TYPE,EdgeContainer>(){}
|
||||
PerEdgeAttributeHandle( void *ah,const int & n):AttributeHandle<ATTR_TYPE,EdgeContainer>(ah,n){};
|
||||
};
|
||||
|
||||
template <class ATTR_TYPE>
|
||||
class PerMeshAttributeHandle{
|
||||
public:
|
||||
PerMeshAttributeHandle(){_handle=NULL;}
|
||||
PerMeshAttributeHandle(void *ah,const int & n):_handle ( (Attribute<ATTR_TYPE> *)ah ),n_attr(n){}
|
||||
PerMeshAttributeHandle operator = ( const PerMeshAttributeHandle & pva){
|
||||
_handle = (Attribute<ATTR_TYPE> *)pva._handle;
|
||||
n_attr = pva.n_attr;
|
||||
return (*this);
|
||||
}
|
||||
Attribute<ATTR_TYPE> * _handle;
|
||||
int n_attr;
|
||||
ATTR_TYPE & operator ()(){ return *((Attribute<ATTR_TYPE> *)_handle)->attribute;}
|
||||
};
|
||||
|
||||
// the camera member (that should keep the intrinsics) is no more needed since 2006, when intrisncs moved into the Shot structure
|
||||
//Camera<ScalarType> camera; // intrinsic
|
||||
Shot<ScalarType> shot; // intrinsic && extrinsic
|
||||
|
||||
private:
|
||||
/// The per-mesh color. Not very useful and meaningful...
|
||||
Color4b c;
|
||||
public:
|
||||
|
||||
inline const Color4b & C() const
|
||||
{
|
||||
return c;
|
||||
}
|
||||
|
||||
inline Color4b & C()
|
||||
{
|
||||
return c;
|
||||
}
|
||||
|
||||
|
||||
/// Default constructor
|
||||
TriMesh()
|
||||
{
|
||||
fn = vn = 0;
|
||||
imark = 0;
|
||||
attrn = 0;
|
||||
C()=Color4b::Gray;
|
||||
}
|
||||
|
||||
/// destructor
|
||||
~TriMesh()
|
||||
{
|
||||
typename std::set< PointerToAttribute>::iterator i;
|
||||
for( i = vert_attr.begin(); i != vert_attr.end(); ++i)
|
||||
delete ((SimpleTempDataBase<VertContainer>*)(*i)._handle);
|
||||
for( i = edge_attr.begin(); i != edge_attr.end(); ++i)
|
||||
delete ((SimpleTempDataBase<EdgeContainer>*)(*i)._handle);
|
||||
for( i = face_attr.begin(); i != face_attr.end(); ++i)
|
||||
delete ((SimpleTempDataBase<FaceContainer>*)(*i)._handle);
|
||||
for( i = mesh_attr.begin(); i != mesh_attr.end(); ++i)
|
||||
delete ((AttributeBase*)(*i)._handle);
|
||||
|
||||
FaceIterator fi;
|
||||
for(fi = face.begin(); fi != face.end(); ++fi) (*fi).Dealloc();
|
||||
}
|
||||
|
||||
int Mem(const int & nv, const int & nf) const {
|
||||
typename std::set< PointerToAttribute>::const_iterator i;
|
||||
int size = 0;
|
||||
size += sizeof(TriMesh)+sizeof(VertexType)*nv+sizeof(FaceType)*nf;
|
||||
|
||||
for( i = vert_attr.begin(); i != vert_attr.end(); ++i)
|
||||
size += ((SimpleTempDataBase<VertContainer>*)(*i)._handle)->SizeOf()*nv;
|
||||
for( i = edge_attr.begin(); i != edge_attr.end(); ++i)
|
||||
size += ((SimpleTempDataBase<EdgeContainer>*)(*i)._handle)->SizeOf()*en;
|
||||
for( i = face_attr.begin(); i != face_attr.end(); ++i)
|
||||
size += ((SimpleTempDataBase<FaceContainer>*)(*i)._handle)->SizeOf()*nf;
|
||||
for( i = mesh_attr.begin(); i != mesh_attr.end(); ++i)
|
||||
size += ((AttributeBase*)(*i)._handle)->SizeOf();
|
||||
|
||||
return size;
|
||||
}
|
||||
int MemUsed() const {return Mem(vert.size(),face.size());}
|
||||
inline int MemNeeded() const {return Mem(vn,fn);}
|
||||
|
||||
|
||||
|
||||
/// Function to destroy the mesh
|
||||
void Clear()
|
||||
{
|
||||
vert.clear();
|
||||
face.clear();
|
||||
// textures.clear();
|
||||
// normalmaps.clear();
|
||||
vn = 0;
|
||||
fn = 0;
|
||||
}
|
||||
|
||||
/// Reflection functions that speak about vertex and face properties.
|
||||
static bool HasPerVertexNormal() { return VertexType::HasNormal() ; }
|
||||
static bool HasPerVertexColor() { return VertexType::HasColor() ; }
|
||||
static bool HasPerVertexMark() { return VertexType::HasMark() ; }
|
||||
static bool HasPerVertexQuality() { return VertexType::HasQuality(); }
|
||||
static bool HasPerVertexTexCoord(){ return VertexType::HasTexCoord(); }
|
||||
static bool HasPerVertexRadius() { return VertexType::HasRadius(); }
|
||||
static bool HasPerVertexFlags() { return VertexType::HasFlags(); }
|
||||
|
||||
static bool HasPolyInfo() { return FaceType::HasPolyInfo() ; }
|
||||
static bool HasPerFaceColor() { return FaceType::HasFaceColor() ; }
|
||||
static bool HasPerFaceNormal() { return FaceType::HasFaceNormal() ; }
|
||||
static bool HasPerFaceMark() { return FaceType::HasFaceMark() ; }
|
||||
static bool HasPerFaceQuality() { return FaceType::HasFaceQuality(); }
|
||||
static bool HasPerFaceFlags() { return FaceType::HasFlags(); }
|
||||
|
||||
static bool HasPerWedgeColor() { return FaceType::HasWedgeColor() ; }
|
||||
static bool HasPerWedgeNormal() { return FaceType::HasWedgeNormal() ; }
|
||||
static bool HasPerWedgeMark() { return FaceType::HasWedgeMark() ; }
|
||||
static bool HasPerWedgeQuality() { return FaceType::HasWedgeQuality(); }
|
||||
static bool HasPerWedgeTexCoord() { return FaceType::HasWedgeTexCoord(); }
|
||||
|
||||
static bool HasFFTopology() { return FaceType::HasFFAdjacency(); }
|
||||
static bool HasVFTopology() { return ((FaceType::HasVFAdjacency())&&(VertexType::HasVFAdjacency())); }
|
||||
static bool HasTopology() { return HasFFTopology() || HasVFTopology(); }
|
||||
|
||||
int & SimplexNumber(){ return fn;}
|
||||
int & VertexNumber(){ return vn;}
|
||||
|
||||
/// The incremental mark
|
||||
int imark;
|
||||
|
||||
/// Calcolo del volume di una mesh chiusa
|
||||
ScalarType Volume()
|
||||
{
|
||||
FaceIterator fi;
|
||||
int j,k;
|
||||
ScalarType V = 0;
|
||||
CoordType T,N,B;
|
||||
|
||||
for(fi = face.begin(); fi!=face.end(); ++fi)
|
||||
{
|
||||
for(j = 0; j < 3; ++j)
|
||||
{
|
||||
/*calcolo tangente, normale e binormale (6 volte)*/
|
||||
k = (j+1)%3;
|
||||
T = (*fi).P(k) - (*fi).P(j);
|
||||
T.Normalize();
|
||||
B = ( (*fi).P( k ) - (*fi).P(j) ) ^
|
||||
( (*fi).P((k+1)%3) - (*fi).P(j) ) ;
|
||||
B.Normalize();
|
||||
N = T ^ B;
|
||||
|
||||
CoordType pj = (*fi).P(j);
|
||||
CoordType pk = (*fi).P(k);
|
||||
|
||||
|
||||
V += (pk* T )*(pk*N)*(pk*B);
|
||||
V += (pj*(-T))*(pj*N)*(pj*B);
|
||||
}
|
||||
}
|
||||
return V/6.0;
|
||||
}
|
||||
|
||||
private:
|
||||
// TriMesh cannot be copied. Use Append (see vcg/complex/trimesh/append.h)
|
||||
TriMesh operator =(const TriMesh & m){assert(0);return TriMesh();}
|
||||
TriMesh(const TriMesh & ){}
|
||||
|
||||
}; // end class Mesh
|
||||
|
||||
/// Initialize the imark-system of the faces
|
||||
template <class MeshType> inline void InitFaceIMark(MeshType & m)
|
||||
{
|
||||
typename MeshType::FaceIterator f;
|
||||
|
||||
for(f=m.face.begin();f!=m.face.end();++f)
|
||||
if( !(*f).IsD() && (*f).IsR() && (*f).IsW() )
|
||||
(*f).InitIMark();
|
||||
}
|
||||
|
||||
/// Initialize the imark-system of the vertices
|
||||
template <class MeshType> inline void InitVertexIMark(MeshType & m)
|
||||
{
|
||||
typename MeshType::VertexIterator vi;
|
||||
|
||||
for(vi=m.vert.begin();vi!=m.vert.end();++vi)
|
||||
if( !(*vi).IsD() && (*vi).IsRW() )
|
||||
(*vi).InitIMark();
|
||||
}
|
||||
/** Access function to the incremental mark.
|
||||
*/
|
||||
template <class MeshType> inline int & IMark(MeshType & m){return m.imark;}
|
||||
|
||||
/** Check if the vertex incremental mark matches the one of the mesh.
|
||||
@param v Vertex pointer
|
||||
*/
|
||||
template <class MeshType> inline bool IsMarked(MeshType & m, typename MeshType::ConstVertexPointer v ) { return v->IMark() == m.imark; }
|
||||
/** Check if the face incremental mark matches the one of the mesh.
|
||||
@param v Face pointer
|
||||
*/
|
||||
template <class MeshType> inline bool IsMarked( MeshType & m,typename MeshType::ConstFacePointer f ) { return f->IMark() == m.imark; }
|
||||
/** Set the vertex incremental mark of the vertex to the one of the mesh.
|
||||
@param v Vertex pointer
|
||||
*/
|
||||
template <class MeshType> inline void Mark(MeshType & m, typename MeshType::VertexPointer v ) { v->IMark() = m.imark; }
|
||||
/** Set the face incremental mark of the vertex to the one of the mesh.
|
||||
@param v Vertex pointer
|
||||
*/
|
||||
template <class MeshType> inline void Mark(MeshType & m, typename MeshType::FacePointer f ) { f->IMark() = m.imark; }
|
||||
/// Unmark the mesh
|
||||
template <class MeshType> inline void UnMarkAll(MeshType & m) { ++m.imark; }
|
||||
|
||||
|
||||
|
||||
template < class ContainerType0, class ContainerType1 , class ContainerType2, class ContainerType3>
|
||||
bool HasPerVertexVFAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasVFAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1 , class ContainerType2, class ContainerType3>
|
||||
bool HasPerVertexQuality (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasQuality();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1 , class ContainerType2, class ContainerType3>
|
||||
bool HasPerVertexMark (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasMark();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerVertexCurvature (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasCurvature();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1 , class ContainerType2, class ContainerType3>
|
||||
bool HasPerVertexCurvatureDir (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasCurvatureDir();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1 , class ContainerType2, class ContainerType3>
|
||||
bool HasPerVertexColor (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasColor();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerVertexTexCoord (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasTexCoord();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerVertexFlags (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasFlags();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2, class ContainerType3 >
|
||||
bool HasPerVertexNormal (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasNormal();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerVertexRadius (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasRadius();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerWedgeTexCoord (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasWedgeTexCoord();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerWedgeNormal (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasWedgeNormal();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerWedgeColor (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasWedgeColor();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerFaceVFAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasVFAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerFaceFlags (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFlags();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerFaceNormal (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFaceNormal();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerFaceColor (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFaceColor();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerFaceMark (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasMark();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasPerFaceQuality (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFaceQuality();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasFFAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFFAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasFEAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFEAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasFVAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasFVAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasVEAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasVEAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasVHAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasVHAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasEVAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::EdgeType::HasEVAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasEEAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::EdgeType::HasEEAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasEFAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::EdgeType::HasEFAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasEHAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::EdgeType::HasEHAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasFHAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceType::HasFHAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasHVAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::HEdgeType::HasHVAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasHEAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::HEdgeType::HasHEAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasHFAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::HEdgeType::HasHFAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasHNextAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh< ContainerType0, ContainerType1, ContainerType2 , ContainerType3>::HEdgeType::HasHNextAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasHPrevAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh< ContainerType0, ContainerType1, ContainerType2 , ContainerType3>::HEdgeType::HasHPrevAdjacency();}
|
||||
|
||||
template < class ContainerType0, class ContainerType1, class ContainerType2 , class ContainerType3>
|
||||
bool HasHOppAdjacency (const TriMesh < ContainerType0, ContainerType1, ContainerType2, ContainerType3> & /*m*/) {return TriMesh< ContainerType0, ContainerType1, ContainerType2 , ContainerType3>::HEdgeType::HasHOppAdjacency();}
|
||||
|
||||
//template < class ContainerType0, class ContainerType1 , class ContainerType2, class ContainerType3>
|
||||
//bool HasVFAdjacency (const TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3> & m ) {
|
||||
// // gcc 4.4: if the expressions assigned to a1 and a2 are replaced in the assert we get a compilation error
|
||||
// // for the macro assert
|
||||
// bool a1 = TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::FaceContainer::value_type::HasVFAdjacency();
|
||||
// bool a2 = TriMesh < ContainerType0 , ContainerType1, ContainerType2, ContainerType3>::VertContainer::value_type::HasVFAdjacency();
|
||||
// // a1 and a2 are still evaluated but not referenced, this causes a warning
|
||||
// (void)a1;
|
||||
// (void)a2;
|
||||
// assert(a1==a2);
|
||||
//
|
||||
// return vcg::tri::HasPerVertexVFAdjacency< ContainerType0, ContainerType1 , ContainerType2, ContainerType3>(m) &&
|
||||
// vcg::tri::HasPerFaceVFAdjacency< ContainerType0, ContainerType1 , ContainerType2, ContainerType3>(m) ;
|
||||
//}
|
||||
|
||||
template <class MESH_TYPE>
|
||||
bool HasPerVertexAttribute(const MESH_TYPE &m, std::string name){
|
||||
typename std::set< typename MESH_TYPE::PointerToAttribute>::const_iterator ai;
|
||||
typename MESH_TYPE::PointerToAttribute h;
|
||||
h._name = name;
|
||||
ai = m.vert_attr.find(h);
|
||||
return (ai!= m.vert_attr.end() ) ;
|
||||
}
|
||||
template <class MESH_TYPE>
|
||||
bool HasPerFaceAttribute(const MESH_TYPE &m, std::string name){
|
||||
typename std::set< typename MESH_TYPE::PointerToAttribute>::const_iterator ai;
|
||||
typename MESH_TYPE::PointerToAttribute h;
|
||||
h._name = name;
|
||||
ai = m.face_attr.find(h);
|
||||
return (ai!= m.face_attr.end() ) ;
|
||||
}
|
||||
|
||||
template <class MESH_TYPE>
|
||||
bool HasPerMeshAttribute(const MESH_TYPE &m, std::string name){
|
||||
typename std::set< typename MESH_TYPE::PointerToAttribute>::const_iterator ai;
|
||||
typename MESH_TYPE::PointerToAttribute h;
|
||||
h._name = name;
|
||||
ai = m.mesh_attr.find(h);
|
||||
return (ai!= m.mesh_attr.end() ) ;
|
||||
}
|
||||
|
||||
/*@}*/
|
||||
/*@}*/
|
||||
} // end namespace
|
||||
} // end namespace
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
Loading…
Reference in New Issue