CGAL 4.6.1 - 3D Triangulations
|
The vertex base used by the geometric triangulation must store a point. So we list here the additional requirements compared to a vertex base usable for the triangulation data structure.
TriangulationCellBase_3
Types | |
typedef unspecified_type | Point |
Must be the same as the point type TriangulationTraits_3::Point_3 defined by the geometric traits class of the triangulation. | |
Creation | |
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 . | |
Access Functions | |
Point | point () const |
Returns the point. | |
Setting | |
void | set_point (Point p) |
Sets the point. | |
I/O | |
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. | |