Concept

SegmentDelaunayGraphHierarchyVertexBase_2

Definition

The vertex of a segment Delaunay graph included in a segment Delaunay graph hierarchy has to provide some pointers to the corresponding vertices in the graphs of the next and preceeding levels. Therefore, the concept SegmentDelaunayGraphHierarchyVertexBase_2 refines the concept SegmentDelaunayGraphVertexBase_2, by adding two vertex handles to the correponding vertices for the next and previous level graphs.

Refines

SegmentDelaunayGraphVertexBase_2

Types

SegmentDelaunayGraphHierarchyVertexBase_2 does not introduce any types in addition to those of SegmentDelaunayGraphVertexBase_2.

Creation

The SegmentDelaunayGraphHierarchyVertexBase_2 concept does not introduce any constructors in addition to those of the SegmentDelaunayGraphVertexBase_2 concept.

Operations

Vertex_handle v.up () Returns a handle to the corresponding vertex of the next level segment Delaunay graph. If such a vertex does not exist Vertex_handle() is returned.
Vertex_handle v.down () Returns a handle to the corresponding vertex of the previous level segment Delaunay graph. If such a vertex does not exist Vertex_handle() is returned.
void v.set_up ( Vertex_handle u) Sets the handle for the vertex of the next level segment Delaunay graph.
void v.set_down ( Vertex_handle d) Sets the handle for the vertex of the previous level segment Delaunay graph.

Has Models

CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<Gt,SSTag> >

See Also

SegmentDelaunayGraphDataStructure_2
SegmentDelaunayGraphVertexBase_2
CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,DS>
CGAL::Triangulation_data_structure_2<Vb,Fb>
CGAL::Segment_Delaunay_graph_vertex_base_2<Gt,SSTag>
CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<Vbb>