diff --git a/vcg/simplex/edgeplus/base.h b/vcg/simplex/edgeplus/base.h deleted file mode 100644 index 1fa55083..00000000 --- a/vcg/simplex/edgeplus/base.h +++ /dev/null @@ -1,249 +0,0 @@ -/**************************************************************************** -* 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. * -* * -****************************************************************************/ - -#ifndef __VCG_EDGE_PLUS -#define __VCG_EDGE_PLUS - -//#include -//#include -//#include -#include -#include - -namespace vcg { - -/*------------------------------------------------------------------*/ -/* -The base class of all the recusive definition chain. It is just a container of the typenames of the various simplexes. -These typenames must be known form all the derived classes. -*/ - -template -class EdgeTypeHolder{ - public: - typedef BVT VertexType; - typedef typename VertexType::CoordType CoordType; - typedef typename VertexType::ScalarType ScalarType; - typedef BET EdgeType; - typedef BFT FaceType; - typedef BTT TetraType; - typedef BVT *VertexPointer; - typedef BET *EdgePointer; - typedef BFT *FacePointer; - typedef BTT *TetraPointer; - template < class LeftV> - void ImportLocal(const LeftV & /* left */ ) { } - static void Name(std::vector & name){} - -}; - -/* The base class form which we start to add our components. -it has the empty definition for all the standard members (coords, color flags) -Note: -in order to avoid both virtual classes and ambiguous definitions all -the subsequent overrides must be done in a sequence of derivation. - -In other words we cannot derive and add in a single derivation step -(with multiple ancestor), both the real (non-empty) normal and color but -we have to build the type a step a time (deriving from a single ancestor at a time). - - -*/ -template -class EdgeBase: public edge::EmptyEVAdj< - edge::EmptyEEAdj< - edge::EmptyHEdgeData< - edge::EmptyBitFlags< - EdgeTypeHolder > > > > { -}; - - -/* The Real Big Edge class; - -The class __VertexArityMax__ is the one that is the Last to be derived, -and therefore is the only one to know the real members -(after the many overrides) so all the functions with common behaviour -using the members defined in the various Empty/nonEmpty component classes -MUST be defined here. - -I.e. IsD() that uses the overridden Flags() member must be defined here. - -*/ - -template class A, template class B, - template class C, template class D, - template class E, template class F, - template class G, template class H, - template class I, template class J, - template class K> -class EdgeArityMax: public K > { - -// ----- Flags stuff ----- -public: - - - enum { - - DELETED = 0x0001, // This bit indicate that the edge is deleted from the mesh - NOTREAD = 0x0002, // This bit indicate that the edge of the mesh is not readable - NOTWRITE = 0x0004, // This bit indicate that the edge is not modifiable - MODIFIED = 0x0008, // This bit indicate that the edge is modified - VISITED = 0x0010, // This bit can be used to mark the visited edge - SELECTED = 0x0020, // This bit can be used to select - BORDER = 0x0100, // Border Flag - USER0 = 0x0200 // First user bit - }; - - inline int & UberFlags () { return this->Flags(); } - inline const int UberFlags() const { return this->Flags(); } - - bool IsD() const {return (this->Flags() & DELETED) != 0;} /// checks if the vertex is deleted - bool IsR() const {return (this->Flags() & NOTREAD) == 0;} /// checks if the vertex is readable - bool IsW() const {return (this->Flags() & NOTWRITE)== 0;}/// checks if the vertex is modifiable - bool IsRW() const {return (this->Flags() & (NOTREAD | NOTWRITE)) == 0;}/// This funcion checks whether the vertex is both readable and modifiable - bool IsS() const {return (this->Flags() & SELECTED) != 0;}/// checks if the vertex is Selected - bool IsB() const {return (this->Flags() & BORDER) != 0;}/// checks if the vertex is a border one - bool IsV() const {return (this->Flags() & VISITED) != 0;}/// checks if the vertex Has been visited - - - /** Set the flag value - @param flagp Valore da inserire nel flag - */ - void SetFlags(int flagp) {this->Flags()=flagp;} - - /** Set the flag value - @param flagp Valore da inserire nel flag - */ - void ClearFlags() {this->Flags()=0;} - void SetD() {this->Flags() |=DELETED;}/// deletes the edge from the mesh - void ClearD() {this->Flags() &=(~DELETED);}/// un-delete a edge - void SetR() {this->Flags() &=(~NOTREAD);}/// marks the edge as readable - void ClearR() {this->Flags() |=NOTREAD;}/// marks the edge as not readable - void ClearW() {this->Flags() |=NOTWRITE;}/// marks the edge as writable - void SetW() {this->Flags() &=(~NOTWRITE);}/// marks the edge as not writable - void SetS() {this->Flags() |=SELECTED;}/// select the edge - void ClearS() {this->Flags() &= ~SELECTED;}/// Un-select a edge - void SetB() {this->Flags() |=BORDER;} - void ClearB() {this->Flags() &=~BORDER;} - void SetV() {this->Flags() |=VISITED;} - void ClearV() {this->Flags() &=~VISITED;} - -/// Return the first bit that is not still used -static int &LastBitFlag() - { - static int b =USER0; - return b; - } - -/// allocate a bit among the flags that can be used by user. -static inline int NewBitFlag() - { - LastBitFlag()=LastBitFlag()<<1; - return LastBitFlag(); - } -// de-allocate a bit among the flags that can be used by user. -static inline bool DeleteBitFlag(int bitval) - { - if(LastBitFlag()==bitval) { - LastBitFlag()= LastBitFlag()>>1; - return true; - } - assert(0); - return false; - } - /// This function checks if the given user bit is true - bool IsUserBit(int userBit){return (this->Flags() & userBit) != 0;} - /// This function set the given user bit - void SetUserBit(int userBit){this->Flags() |=userBit;} - /// This function clear the given user bit - void ClearUserBit(int userBit){this->Flags() &= (~userBit);} - - template - void GetBBox( BoxType & bb ) const { - bb.SetNull(); - bb.Add(this->cP(0)); - bb.Add(this->cP(1)); - } - - }; - - -/* - -These are the three main classes that are used by the library user to define its own edges. -The user MUST specify the names of all the type involved in a generic complex. -so for example when defining a vertex of a trimesh you must know the name of the type of the edge and of the face. -Typical usage example: - -A vertex with coords, flags and normal for use in a standard trimesh: - -class VertexNf : public VertexSimp2< VertexNf, EdgeProto, FaceProto, vert::Coord3d, vert::Flag, vert::Normal3f > {}; - - -A vertex with coords, and normal for use in a tetrahedral mesh AND in a standard trimesh: - -class TetraVertex : public VertexSimp3< TetraVertex, EdgeProto, FaceProto, TetraProto, vert::Coord3d, vert::Normal3f > {}; - - -A summary of the available vertex attributes (see component.h for more details): - -Coord3f, Coord3d, -Normal3s, Normal3f, Normal3d -Mark //a int component (incremental mark) -BitFlags -TexCoord2s, TexCoord2f, TexCoord2d -Color4b -Qualitys, Qualityf, Qualityd -VFAdj //topology (vertex->face adjacency) -*/ - -template class A = DefaultDeriver, template class B = DefaultDeriver, - template class C = DefaultDeriver, template class D = DefaultDeriver, - template class E = DefaultDeriver, template class F = DefaultDeriver, - template class G = DefaultDeriver, template class H = DefaultDeriver, - template class I = DefaultDeriver, template class J = DefaultDeriver, - template class K = DefaultDeriver> - class EdgeSimp3: public EdgeArityMax {}; - -template class A = DefaultDeriver, template class B = DefaultDeriver, - template class C = DefaultDeriver, template class D = DefaultDeriver, - template class E = DefaultDeriver, template class F = DefaultDeriver, - template class G = DefaultDeriver, template class H = DefaultDeriver, - template class I = DefaultDeriver, template class J = DefaultDeriver, - template class K = DefaultDeriver> - class EdgeSimp2: public EdgeArityMax {}; - -template class A = DefaultDeriver, template class B = DefaultDeriver, - template class C = DefaultDeriver, template class D = DefaultDeriver, - template class E = DefaultDeriver, template class F = DefaultDeriver, - template class G = DefaultDeriver, template class H = DefaultDeriver, - template class I = DefaultDeriver, template class J = DefaultDeriver, - template class K = DefaultDeriver> - class EdgeSimp1: public EdgeArityMax {}; - -}// end namespace -#endif diff --git a/vcg/simplex/edgeplus/component.h b/vcg/simplex/edgeplus/component.h deleted file mode 100644 index 0d8cdf01..00000000 --- a/vcg/simplex/edgeplus/component.h +++ /dev/null @@ -1,489 +0,0 @@ -/**************************************************************************** -* 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. * -* * -****************************************************************************/ - -#ifndef __VCG_EDGE_PLUS_COMPONENT -#define __VCG_EDGE_PLUS_COMPONENT -//#include -//#include -//#include -//#include -#include - -namespace vcg { - namespace edge { -/* -Some naming Rules -All the Components that can be added to a vertex should be defined in the namespace edge: - -*/ - -/*-------------------------- VERTEX ----------------------------------------*/ -template class EmptyVertexRef: public T { -public: - // typedef typename T::VertexType VertexType; - // typedef typename T::CoordType CoordType; - inline typename T::VertexType * & V( const int j ) { assert(0); static typename T::VertexType *vp=0; return vp; } - inline typename T::VertexType * const & V( const int j ) const { assert(0); static typename T::VertexType *vp=0; return vp; } - inline typename T::VertexType * const cV( const int j ) const { assert(0); static typename T::VertexType *vp=0; return vp; } - inline typename T::CoordType & P( const int j ) { assert(0); static typename T::CoordType coord(0, 0, 0); return coord; } - inline const typename T::CoordType & P( const int j ) const { assert(0); static typename T::CoordType coord(0, 0, 0); return coord; } - inline const typename T::CoordType &cP( const int j ) const { assert(0); static typename T::CoordType coord(0, 0, 0); return coord; } - template - void ImportLocal(const LeftF & leftF) {T::ImportLocal(leftF);} - static bool HasVertexRef() { return false; } - static void Name(std::vector & name){T::Name(name);} - -}; -template class VertexRef: public T { -public: - VertexRef(){ - v[0]=0; - v[1]=0; - } - - inline typename T::VertexType * & V( const int j ) { assert(j>=0 && j<2); return v[j]; } - inline typename T::VertexType * const & V( const int j ) const { assert(j>=0 && j<2); return v[j]; } - inline typename T::VertexType * const cV( const int j ) const { assert(j>=0 && j<2); return v[j]; } - - // Shortcut per accedere ai punti delle facce - inline typename T::CoordType & P( const int j ) { assert(j>=0 && j<2); return v[j]->P(); } - inline const typename T::CoordType &cP( const int j ) const { assert(j>=0 && j<2); return v[j]->cP(); } - - /** Return the pointer to the ((j+1)%3)-th vertex of the face. - @param j Index of the face vertex. - */ - inline typename T::VertexType * & V0( const int j ) { return V(j);} - inline typename T::VertexType * & V1( const int j ) { return V((j+1)%2);} - inline const typename T::VertexType * const & V0( const int j ) const { return V(j);} - inline const typename T::VertexType * const & V1( const int j ) const { return V((j+1)%2);} - inline const typename T::VertexType * const & cV0( const int j ) const { return cV(j);} - inline const typename T::VertexType * const & cV1( const int j ) const { return cV((j+1)%2);} - - /// Shortcut per accedere ai punti delle facce - inline typename T::CoordType & P0( const int j ) { return V(j)->P();} - inline typename T::CoordType & P1( const int j ) { return V((j+1)%2)->P();} - inline const typename T::CoordType & P0( const int j ) const { return V(j)->P();} - inline const typename T::CoordType & P1( const int j ) const { return V((j+1)%2)->P();} - inline const typename T::CoordType & cP0( const int j ) const { return cV(j)->P();} - inline const typename T::CoordType & cP1( const int j ) const { return cV((j+1)%2)->P();} - - inline typename T::VertexType * & UberV( const int j ) { assert(j>=0 && j<2); return v[j]; } - inline const typename T::VertexType * const & UberV( const int j ) const { assert(j>=0 && j<2); return v[j]; } - - template - void ImportLocal(const LeftF & leftF){ V(0) = NULL; V(1) = NULL; V(2) = NULL; T::ImportLocal(leftF);} - - static bool HasVertexRef() { return true; } - static void Name(std::vector & name){name.push_back(std::string("VertexRef"));T::Name(name);} - - - private: - typename T::VertexType *v[2]; -}; - - - -/*-------------------------- INCREMENTAL MARK ----------------------------------------*/ - -template class EmptyMark: public T { -public: - static bool HasMark() { return false; } - static bool HasMarkOcc() { return false; } - inline void InitIMark() { } - inline int & IMark() { assert(0); static int tmp=-1; return tmp;} - inline const int & IMark() const {return 0;} - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static void Name(std::vector & name){T::Name(name);} - -}; -template class Mark: public T { -public: - static bool HasMark() { return true; } - static bool HasMarkOcc() { return true; } - inline void InitIMark() { _imark = 0; } - inline int & IMark() { return _imark;} - inline const int & IMark() const {return _imark;} - template < class LeftV> - void ImportLocal(const LeftV & left ) { IMark() = left.IMark(); T::ImportLocal( left); } - static void Name(std::vector & name){name.push_back(std::string("Mark"));T::Name(name);} - - private: - int _imark; -}; - -/*------------------------- FLAGS -----------------------------------------*/ -template class EmptyBitFlags: public T { -public: - typedef int FlagType; - /// Return the vector of Flags(), senza effettuare controlli sui bit - int &Flags() { static int dummyflags(0); assert(0); return dummyflags; } - const int Flags() const { return 0; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasFlags() { return false; } - static void Name(std::vector & name){T::Name(name);} - -}; - -template class BitFlags: public T { -public: - BitFlags(){_flags=0;} - typedef int FlagType; - int &Flags() {return _flags; } - const int Flags() const {return _flags; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { Flags() = left.Flags(); T::ImportLocal( left); } - static bool HasFlags() { return true; } - static void Name(std::vector & name){name.push_back(std::string("BitFlags"));T::Name(name);} - -private: - int _flags; -}; - -/*-------------------------- EMPTY COLOR & QUALITY ----------------------------------*/ - -template class EmptyColorQuality: public T { -public: - typedef float QualityType; - QualityType &Q() { static QualityType dummyQuality(0); assert(0); return dummyQuality; } - static bool HasQuality() { return false; } - - typedef vcg::Color4b ColorType; - ColorType &C() { static ColorType dumcolor(vcg::Color4b::White); assert(0); return dumcolor; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasColor() { return false; } - static void Name(std::vector & name){T::Name(name);} -}; - -/*-------------------------- Color ----------------------------------*/ - -template class Color: public T { -public: - Color():_color(vcg::Color4b::White) {} - typedef A ColorType; - ColorType &C() { return _color; } - const ColorType &C() const { return _color; } - const ColorType &cC() const { return _color; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { C() = left.cC(); T::ImportLocal( left); } - static bool HasColor() { return true; } - static void Name(std::vector & name){name.push_back(std::string("Color"));T::Name(name);} - -private: - ColorType _color; -}; - -template class Color4b: public edge::Color { - public: static void Name(std::vector & name){name.push_back(std::string("Color4b"));TT::Name(name);} -}; - -/*-------------------------- Quality ----------------------------------*/ - -template class Quality: public TT { -public: - typedef A QualityType; - QualityType &Q() { return _quality; } - const QualityType & cQ() const {return _quality; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { Q() = left.cQ(); TT::ImportLocal( left); } - static bool HasQuality() { return true; } - static void Name(std::vector & name){name.push_back(std::string("Quality"));TT::Name(name);} - -private: - QualityType _quality; -}; - -template class Qualitys: public Quality { -public: static void Name(std::vector & name){name.push_back(std::string("Qualitys"));TT::Name(name);} -}; -template class Qualityf: public Quality { -public: static void Name(std::vector & name){name.push_back(std::string("Qualityf"));TT::Name(name);} -}; -template class Qualityd: public Quality { -public: static void Name(std::vector & name){name.push_back(std::string("Qualityd"));TT::Name(name);} -}; - -/*----------------------------- EVADJ ------------------------------*/ -template class EmptyEVAdj: public T { -public: - typename T::VertexPointer &V(const int &) { static typename T::VertexPointer ep=0; assert(0); return ep; } - typename T::VertexPointer cV(const int &) { static typename T::VertexPointer ep=0; assert(0); return ep; } - int &EVi(){static int z=0; return z;}; - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasEVAdjacency() { return false; } - static bool HasEVAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class EVAdj: public T { -public: - EVAdj(){_vp[0]= _vp[1] =0;} - typename T::VertexPointer & V(const int & i) {return _vp[i]; } - const typename T::VertexPointer cV(const int & i) const {return _vp[i]; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { V() = NULL; T::ImportLocal( left); } - static bool HasEVAdjacency() { return true; } - static bool HasEVAdjacencyOcc() { return true; } - static void Name(std::vector & name){name.push_back(std::string("EVAdj"));T::Name(name);} - -private: - typename T::VertexPointer _vp[2] ; -}; - -/*----------------------------- HEVADJ ------------------------------*/ -template class EmptyHEVAdj: public T { -public: - typename T::VertexPointer &HEVp() { static typename T::VertexPointer ep=0; assert(0); return ep; } - typename T::VertexPointer cHEVp() { static typename T::VertexPointer ep=0; assert(0); return ep; } - int &EVi(){static int z=0; return z;}; - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasHEVAdjacency() { return false; } - static bool HasHEVAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class HEVAdj: public T { -public: - HEVAdj(){_vp =0;} - typename T::VertexPointer & HEVp() {return _vp ; } - const typename T::VertexPointer cHEVp() const {return _vp ; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { this->V() = NULL; T::ImportLocal( left); } - static bool HasHEVAdjacency() { return true; } - static bool HasHEVAdjacencyOcc() { return true; } - static void Name(std::vector & name){name.push_back(std::string("HEVAdj"));T::Name(name);} - -private: - typename T::VertexPointer _vp ; -}; - -/*----------------------------- EEADJ ------------------------------*/ -template class EmptyEEAdj: public T { -public: - typename T::EdgePointer &EEp(const int & i ) { static typename T::EdgePointer ep=0; assert(0); return ep; } - typename T::EdgePointer cEEp(const int & i) { static typename T::EdgePointer ep=0; assert(0); return ep; } - int &EEi(){static int z=0; return z;}; - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasEEAdjacency() { return false; } - static bool HasEEAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class EEAdj: public T { -public: - EEAdj(){_ep=0;} - typename T::EdgePointer &EEp(const int & i) {return _ep[i]; } - typename T::EdgePointer cEEp(const int & i) {return _ep[i]; } - int &EEi(const int & i) {return _zp[i]; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { EEp() = NULL; T::ImportLocal( left); } - static bool HasEEAdjacency() { return true; } - static bool HasEEAdjacencyOcc() { return true; } - static void Name(std::vector & name){name.push_back(std::string("EEAdj"));T::Name(name);} - -private: - typename T::EdgePointer _ep[2] ; - int _zp[2] ; -}; - - -/*----------------------------- ETADJ ------------------------------*/ - - -template class EmptyETAdj: public T { -public: - typename T::TetraPointer &ETp() { static typename T::TetraPointer tp = 0; assert(0); return tp; } - typename T::TetraPointer cETp() { static typename T::TetraPointer tp = 0; assert(0); return tp; } - int &VTi() { static int z = 0; return z; }; - static bool HasETAdjacency() { return false; } - static bool HasETAdjacencyOcc() { return false; } - static void Name( std::vector< std::string > & name ) { T::Name(name); } -}; - -template class ETAdj: public T { -public: - ETAdj() { _tp = 0; } - typename T::TetraPointer &ETp() { return _tp; } - typename T::TetraPointer cETp() { return _tp; } - int &ETi() {return _zp; } - static bool HasETAdjacency() { return true; } - static bool HasETAdjacencyOcc() { return true; } - static void Name( std::vector< std::string > & name ) { name.push_back( std::string("ETAdj") ); T::Name(name); } - -private: - typename T::TetraPointer _tp ; - int _zp ; -}; - - - -/*----------------------------- HENextADJ ------------------------------*/ -template class EmptyHENextAdj: public T { -public: - typename T::EdgePointer &HENp( ) { static typename T::EdgePointer ep=0; assert(0); return ep; } - typename T::EdgePointer cHEp( ) { static typename T::EdgePointer ep=0; assert(0); return ep; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasHENextAdjacency() { return false; } - static bool HasHENextAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class HENextAdj: public T { -public: - HENextAdj(){_nep=0;} - typename T::EdgePointer &HENp() {return _nep; } - typename T::EdgePointer cHENp() {return _nep; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { this->EEp() = NULL; T::ImportLocal( left); } - static bool HasHENextAdjacency() { return true; } - static void Name(std::vector & name){name.push_back(std::string("HENextAdj"));T::Name(name);} - -private: - typename T::EdgePointer _nep ; -}; - -/*----------------------------- HEOppADJ ------------------------------*/ -template class EmptyHEOppAdj: public T { -public: - typename T::EdgePointer &HEOp(const int & i ) { static typename T::EdgePointer ep=0; assert(0); return ep; } - typename T::EdgePointer cHOp(const int & i) { static typename T::EdgePointer ep=0; assert(0); return ep; } - int &EEi(){static int z=0; return z;}; - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasHEOppAdjacency() { return false; } - static bool HasHEOpptAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class HEOppAdj: public T { -public: - HEOppAdj(){_oep=0;} - typename T::EdgePointer &HEOp() {return _oep; } - typename T::EdgePointer cHEOp() {return _oep; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { this->EEp() = NULL; T::ImportLocal( left); } - static bool HasHEOppAdjacency() { return true; } - static void Name(std::vector & name){name.push_back(std::string("HEOpptAdj"));T::Name(name);} - -private: - typename T::EdgePointer _oep ; - -}; -/*----------------------------- HEPrevADJ ------------------------------*/ -template class EmptyHEPrevAdj: public T { -public: - typename T::EdgePointer &HEPp() { static typename T::EdgePointer ep=0; assert(0); return ep; } - typename T::EdgePointer cHPp() { static typename T::EdgePointer ep=0; assert(0); return ep; } - int &EEi(){static int z=0; return z;}; - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasHEPrevAdjacency() { return false; } - static bool HasHEPrevAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class HEPrevAdj: public T { -public: - HEPrevAdj(){_pep=0;} - typename T::EdgePointer &HEPp() {return _pep; } - typename T::EdgePointer cHEPp() {return _pep; } - int &EEi(const int & i) {return this->_nei[i]; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { this->EEp() = NULL; T::ImportLocal( left); } - static bool HasHEPrevAdjacency() { return true; } - static void Name(std::vector & name){name.push_back(std::string("HEPrevAdj"));T::Name(name);} - -private: - typename T::EdgePointer _pep ; -}; -/*----------------------------- EFADJ ------------------------------*/ - -template class EmptyEFAdj: public T { -public: - typename T::FacePointer &EFp() { static typename T::FacePointer fp=0; assert(0); return fp; } - typename T::FacePointer cEFp() { static typename T::FacePointer fp=0; assert(0); return fp; } - int &EFi(){static int z=0; return z;}; - template < class LeftV> - void ImportLocal(const LeftV & left ) { T::ImportLocal( left); } - static bool HasEFAdjacency() { return false; } - static bool HasEFAdjacencyOcc() { return false; } - static void Name(std::vector & name){ T::Name(name);} -}; - -template class EFAdj: public T { -public: - EFAdj(){_fp=0;} - typename T::FacePointer &EFp() {return _fp; } - typename T::FacePointer cEFp() {return _fp; } - int &EFi() {return _zp; } - template < class LeftV> - void ImportLocal(const LeftV & left ) { this->EFp() = NULL; T::ImportLocal( left); } - static bool HasEFAdjacency() { return true; } - static bool HasEFAdjacencyOcc() { return true; } - static void Name(std::vector & name){name.push_back(std::string("EFAdj"));T::Name(name);} - -private: - typename T::FacePointer _fp ; - int _zp ; -}; - - -/*----------------------------- EFADJ ------------------------------*/ -/** - HEdgeData keep all the data for the half edge -*/ -template -class EmptyHEdgeData : public EmptyEFAdj< // pointer to the face - EmptyHEOppAdj < // pointer to the opposite half edge - EmptyHENextAdj < // pointer to the next half edge along the face - EmptyHEVAdj < // pointer to the vertex - EmptyHEPrevAdj< - T > > > > >{}; - - -template -class HEdgeData : public EFAdj< // pointer to the face - HEOppAdj < // pointer to the opposite half edge - HENextAdj < // pointer to the next half edge along the face - HEVAdj < // pointer to the vertex - T > > > >{ - - // functions to make the half edge user confortable - typename T::VertexPointer & Vertex() { return this->HEVp();} - const typename T::VertexPointer & cVertex() const { return this->cHEVp();} - typename T::EdgePointer Opposite() { return &this->HEOp();} - const typename T::EdgePointer & cOpposite() const { return this->cHEOp();} - typename T::EdgePointer & Next() { return this->HENp();} - const typename T::EdgePointer & Next() const { return this->HENp();} - -}; - - } // end namespace edge -}// end namespace vcg -#endif