33 #ifndef indexedVertex_H 34 #define indexedVertex_H 36 #include "CGAL/Triangulation_2.h" 45 template<
class Gt,
class Vb>
48 template<
class Gt,
class Vb>
51 const indexedVertex<Gt, Vb>& v0,
52 const indexedVertex<Gt, Vb>& v1
55 template<
class Gt,
class Vb>
58 const indexedVertex<Gt, Vb>& v0,
59 const indexedVertex<Gt, Vb>& v1,
60 const indexedVertex<Gt, Vb>& v2
63 template<
class Gt,
class Vb>
66 const indexedVertex<Gt, Vb>& v0,
67 const indexedVertex<Gt, Vb>& v1,
68 const indexedVertex<Gt, Vb>& v2
75 template<
class Gt,
class Vb=CGAL::Triangulation_vertex_base_2<Gt>>
133 inline int index()
const;
137 inline int type()
const;
173 friend bool pointPair <Gt, Vb>
180 friend bool boundaryTriangle <Gt, Vb>
188 friend bool outsideTriangle <Gt, Vb>
void setNearBoundary()
Set the point to be near the boundary.
bool mirrorPoint() const
Is point a mirror point.
bool ppMaster() const
Master of a pointPair is the lowest numbered one.
bool pointPair(const indexedVertex< Gt, Vb > &v0, const indexedVertex< Gt, Vb > &v1)
Vb::Face_handle Face_handle
An indexed form of CGAL::Triangulation_vertex_base_3<K> used to keep track of the Delaunay vertices i...
bool nearOrOnBoundary() const
Is point near the boundary or part of the boundary definition.
bool internalPoint() const
Is point internal, i.e. not on boundary.
bool boundaryTriangle(const indexedVertex< Gt, Vb > &v0, const indexedVertex< Gt, Vb > &v1, const indexedVertex< Gt, Vb > &v2)
bool nearBoundary() const
Is point internal and near the boundary.
bool farPoint() const
Is point a far-point.
bool internalOrBoundaryPoint() const
Either original internal point or master of pointPair.
bool pairPoint() const
Either master or slave of pointPair.
bool ppSlave() const
Slave of a pointPair is the highest numbered one.
Tds::Vertex_handle Vertex_handle
indexedVertex< Gt, Vb2 > Other
Vb::template Rebind_TDS< TDS2 >::Other Vb2
bool outsideTriangle(const indexedVertex< Gt, Vb > &v0, const indexedVertex< Gt, Vb > &v1, const indexedVertex< Gt, Vb > &v2)