#include <Concepts/TriangulationOnSphereVertexBase_2.h>
- Refines
TriangulationDSVertexBase_2
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.
- Has models
CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>
- See also
TriangulationDataStructure_2
-
TriangulationOnSphereFaceBase_2
|
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.
|
|
◆ Face_handle
Must be the equivalent to the point type Face_handle
of the triangulation.
◆ Point
◆ TriangulationOnSphereVertexBase_2() [1/2]
TriangulationOnSphereVertexBase_2::TriangulationOnSphereVertexBase_2 |
( |
Point |
p | ) |
|
constructs a vertex whose geometric embedding is the point p
.
◆ TriangulationOnSphereVertexBase_2() [2/2]
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.
◆ operator<<()
outputs the non combinatorial operation 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 TriangulationOnSphereVertexBase_2::point |
( |
| ) |
const |
◆ set_point()
void TriangulationOnSphereVertexBase_2::set_point |
( |
Point |
p | ) |
|