#include <Concepts/TriangulationVertexBase_3.h>
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
◆ Point
◆ TriangulationVertexBase_3() [1/2]
| TriangulationVertexBase_3::TriangulationVertexBase_3 |
( |
const Point & |
p | ) |
|
Constructs a vertex whose geometric embedding is point p.
◆ TriangulationVertexBase_3() [2/2]
| TriangulationVertexBase_3::TriangulationVertexBase_3 |
( |
const Point & |
p, |
|
|
Cell_handle |
c |
|
) |
| |
Constructs a vertex embedding the point p and pointing to cell c.
◆ operator<<()
Outputs the non-combinatorial information given by the vertex: the point and other possible information.
◆ operator>>()
Inputs the non-combinatorial information given by the vertex: the point and other possible information.
◆ point()
| Point TriangulationVertexBase_3::point |
( |
| ) |
const |
◆ set_point()
| void TriangulationVertexBase_3::set_point |
( |
Point |
p | ) |
|