The vertex base used by the geometric triangulation must store a point. We list here the additional requirements compared to a vertex base usable for the triangulation data structure.
- Refines
TriangulationDSVertexBase_3
- Has Models:
CGAL::Triangulation_vertex_base_3
CGAL::Triangulation_vertex_base_with_info_3
- See also
TriangulationCellBase_3
|
| TriangulationVertexBase_3 (const Point &p) |
| Constructs a vertex whose geometric embedding is point p .
|
|
| TriangulationVertexBase_3 (const Point &p, Cell_handle c) |
| Constructs a vertex embedding the point p and pointing to cell c .
|
|
|
Point | point () const |
| Returns the point.
|
|
|
void | set_point (Point p) |
| Sets the point.
|
|
|
istream & | operator>> (istream &is, TriangulationVertexBase_3 &v) |
| Inputs the non-combinatorial information given by the vertex: the point and other possible information.
|
|
ostream & | operator<< (ostream &os, const TriangulationVertexBase_3 &v) |
| Outputs the non-combinatorial information given by the vertex: the point and other possible information.
|
|