CGAL::Voronoi_diagram_2<DG,AT,AP>::Vertex

Definition

The class Voronoi_diagram_2<DG,AT,AP>::Vertex is the Voronoi vertex class provided by the class Voronoi_diagram_2<DG,AT,AP> class. Below we present its interface.

Is Model for the Concepts

DefaultConstructible, CopyConstructible, Assignable, EqualityComparable, LessThanComparable

Types

Voronoi_diagram_2<DG,AT,AP>::Vertex::Halfedge
A type for the halfedges of the Voronoi diagram.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Face
A type for the faces of the Voronoi diagram.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Vertex_handle
Handle for the vertices of the Voronoi diagram.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Face_handle
Handle for the faces of the Voronoi diagram.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Halfedge_handle
Handle for the halfedges of the Voronoi diagram.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Point_2
A type for the point represented by the vertex.

Voronoi_diagram_2<DG,AT,AP>::Vertex::size_type
A type for sizes.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Halfedge_around_vertex_circulator
A type for a bidirectional circulator that allows to traverse all incident halfedges, i.e., all halfedges that have the vertex as their target. The value type of the circulator is CGAL::Voronoi_diagram_2<DG,AT,AP>::Halfedge and is convertible to Halfedge_handle.

Voronoi_diagram_2<DG,AT,AP>::Vertex::Delaunay_graph
A type for the Delaunay graph. It is a model of the DelaunayGraph_2 concept.

typedef Delaunay_graph::Face_handle
Delaunay_face_handle; A type for the handle of the dual face.
typedef Delaunay_graph::Vertex_handle
Delaunay_vertex_handle; A type for the vertex handles in the Delaunay graph.

Access Methods

Halfedge_handle v.halfedge () Returns an incident halfedge that has v as its target.
size_type v.degree () Returns the in-degree of the vertex, i.e. the number of halfedges that have v as their target.
Point_2 v.point () Returns the point represented by the vertex.
Delaunay_face_handle v.dual () Returns a handle to the corresponding dual face in the Delaunay graph.
Delaunay_vertex_handle v.site ( unsigned int i) Returns a handle to the vertex in the Delaunay graph corresponding to the (i+1)-th generating site of the Voronoi vertex.
Precondition: i must be smaller or equal to 2.
Halfedge_around_vertex_circulator v.incident_halfedges () Returns a bidirectional circulator that allows the traversal of the halfedges that have v as their target. Applying operator++ (resp. operator--) to this circulator returns the next incident halfedge in the counterclockwise (resp. clockwise) sense.

Predicate Methods

bool v.is_incident_edge ( Halfedge_handle e)
Returns true if the halfedge e is incident to v.
bool v.is_incident_face ( Face_handle e)
Returns true if the face f is incident to v.
bool v.is_valid () Returns true if the following conditions are met: the dual face is not an infinite face; all incident halfedges have the vertex as their target.

See Also

CGAL::Voronoi_diagram_2<DG,AT,AP>
CGAL::Voronoi_diagram_2<DG,AT,AP>::Halfedge
CGAL::Voronoi_diagram_2<DG,AT,AP>::Face
DelaunayGraph_2