CGAL 5.1 - dD Triangulations
|
#include <Concepts/TriangulationVertex.h>
The concept TriangulationVertex
describes the requirements on the type used by the class CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>
, and its derived classes, to represent a vertex.
TriangulationDSVertex
We only list below the additional specific requirements of TriangulationVertex. Compared to TriangulationDSVertex, the main difference is the addition of an association of the vertex with a geometric point.CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
Input/Output
These operators can be used directly and are called by the I/O operator of class Triangulation
.
CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
TriangulationFullCell
CGAL::Triangulation<TriangulationTraits_, TriangulationDataStructure_>
Types | |
typedef unspecified_type | Point |
The type of the point stored in the vertex. More... | |
Creation | |
TriangulationVertex (Full_cell_handle c, const Point &p) | |
Constructs a vertex with incident full cell c . More... | |
TriangulationVertex (const Point &p) | |
Same as above, but without incident full cell. More... | |
TriangulationVertex () | |
Same as above, but with a default-constructed Point . More... | |
Operations | |
void | set_point (const Point &p) |
The parameter p becomes the new geometrical position of the vertex. More... | |
const Point & | point () const |
Returns the vertex's position. More... | |
std::istream & | operator>> (std::istream &is, TriangulationVertex &v) |
Inputs the non-combinatorial information given by the vertex, i.e., the point and other possible information. More... | |
std::ostream & | operator<< (std::ostream &os, const TriangulationVertex &v) |
Outputs the non-combinatorial information given by the vertex, i.e., the point and other possible information. More... | |
typedef unspecified_type TriangulationVertex::Point |
The type of the point stored in the vertex.
It must be the same as the point type TriangulationTraits::Point_d
when the TriangulationVertex
is used in the class Triangulation<TriangulationTraits, TriangulationDataStructure_>
.
TriangulationVertex::TriangulationVertex | ( | Full_cell_handle | c, |
const Point & | p | ||
) |
Constructs a vertex with incident full cell c
.
The vertex is embedded at point p
.
TriangulationVertex::TriangulationVertex | ( | const Point & | p | ) |
Same as above, but without incident full cell.
TriangulationVertex::TriangulationVertex | ( | ) |
Same as above, but with a default-constructed Point
.
std::ostream& TriangulationVertex::operator<< | ( | std::ostream & | os, |
const TriangulationVertex & | v | ||
) |
Outputs the non-combinatorial information given by the vertex, i.e., the point and other possible information.
std::istream& TriangulationVertex::operator>> | ( | std::istream & | is, |
TriangulationVertex & | v | ||
) |
Inputs the non-combinatorial information given by the vertex, i.e., the point and other possible information.
const Point& TriangulationVertex::point | ( | ) | const |
Returns the vertex's position.
void TriangulationVertex::set_point | ( | const Point & | p | ) |
The parameter p
becomes the new geometrical position of the vertex.