The concept TriangulationVertexBase_2
describes the requirements for the vertex base class of a triangulation data structure to be plugged in a basic, Delaunay or constrained triangulations.
The concept TriangulationVertexBase_2
refines the concept TriangulationDSVertexBase_2
adding geometric information: the vertex base of a triangulation stores a point.
- Refines
TriangulationDSVertexBase_2
- Has models
CGAL::Triangulation_vertex_base_2<Traits,Vb>
- See also
TriangulationDataStructure_2
-
TriangulationDataStructure_2::Vertex
-
CGAL::Triangulation_vertex_base_2<Traits>
|
| TriangulationVertexBase_2 (Point p) |
| constructs a vertex embedded in point p .
|
|
| TriangulationVertexBase_2 (Point p, Face_handle f) |
| constructs a vertex embedded in point p and pointing on face f .
|
|
|
Point | point () const |
| returns the point.
|
|
|
void | set_point (Point p) |
| sets the point.
|
|
istream & | operator>> (istream &is, TriangulationVertexBase_2 &v) |
| Inputs the non-combinatorial information given by the vertex: the point and other possible information.
|
|
ostream & | operator<< (ostream &os, const TriangulationVertexBase_2 &v) |
| Outputs the non combinatorial operation given by the vertex: the point and other possible information.
|
|