vcg::edge::EEAdj< T > Class Template Reference

Component: Edge-Edge adjacency relation This component implement store the pointer (and index) of the adjacent edges. If the vertex is 1-manifold (as in a classical polyline) it holds that: More...

#include <component.h>

Inheritance diagram for vcg::edge::EEAdj< T >:

Public Member Functions
T::EdgePointer &	EEp (const int &i)
T::EdgePointer	cEEp (const int &i) const
int &	EEi (const int &i)
int	cEEi (const int &i) const
template<class LeftV >
void	ImportData (const LeftV &left)

Static Public Member Functions
static bool	HasEEAdjacency ()
static bool	HasEEAdjacencyOcc ()
static void	Name (std::vector< std::string > &name)

Detailed Description

template<class T>
class vcg::edge::EEAdj< T >

Component: Edge-Edge adjacency relation This component implement store the pointer (and index) of the adjacent edges. If the vertex is 1-manifold (as in a classical polyline) it holds that:

e->EEp(i)->EEp(e->EEi(i)) == e

otherwise the edges are connected in a unordered chain (quite similar to how Face-Face adjacency relation is stored);

See also

vcg::tri::UpdateTopology for functions that compute this relation

iterators

---

The documentation for this class was generated from the following file:

• /home/cignoni/devel/vcglib/vcg/simplex/edge/component.h