|
CGAL 4.10 - 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.
RegularTriangulationCellBase_3 Types | |
| typedef unspecified_type | Point |
Must be the same as the point type RegularTriangulationTraits_3::Weighted_point_3 defined by the geometric traits class of the triangulation. | |
Creation | |
| RegularTriangulationVertexBase_3 (const Point &p) | |
Constructs a vertex whose geometric embedding is point p. | |
| RegularTriangulationVertexBase_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, RegularTriangulationVertexBase_3 &v) |
| Inputs the non-combinatorial information given by the vertex: the point and other possible information. | |
| ostream & | operator<< (ostream &os, const RegularTriangulationVertexBase_3 &v) |
| Outputs the non-combinatorial information given by the vertex: the point and other possible information. | |