CGAL 5.5.3 - 2D Triangulations on the Sphere
|
The concept TriangulationOnSphereVertexBase_2
describes the requirements for the vertex base class of a triangulation data structure to be plugged in a triangulation on the sphere. It refines the concept TriangulationDSVertexBase_2
, adding geometric information: the vertex base of a triangulation stores a point.
Types | |
typedef unspecified_type | Point |
Must be the equivalent to the point type Point_on_sphere_2 of the concept TriangulationOnSphereTraits_2 . | |
typedef unspecified_type | Face_handle |
Must be the equivalent to the point type Face_handle of the triangulation. | |
Creation | |
TriangulationOnSphereVertexBase_2 (Point p) | |
constructs a vertex whose geometric embedding is the point p . | |
TriangulationOnSphereVertexBase_2 (Point p, Face_handle f) | |
constructs a vertex whose geometric embedding is the point p and pointing to face f . More... | |
Access Functions | |
Point | point () const |
returns the point. | |
Setting | |
void | set_point (Point p) |
sets the point. | |
std::istream & | operator>> (std::istream &is, TriangulationOnSphereVertexBase_2 &v) |
inputs the non-combinatorial information given by the vertex: the point and other possible information. | |
std::ostream & | operator<< (std::ostream &os, const TriangulationOnSphereVertexBase_2 &v) |
outputs the non combinatorial operation given by the vertex: the point and other possible information. | |
TriangulationOnSphereVertexBase_2::TriangulationOnSphereVertexBase_2 | ( | Point | p, |
Face_handle | f | ||
) |
constructs a vertex whose geometric embedding is the point p
and pointing to face f
.
Face_handle
is the type defined the triangulation data structure used in the Delaunay triangulation on the sphere.