CGAL 5.0.2 - 2D Segment Delaunay Graphs

## Concepts

conceptSegmentDelaunayGraphDataStructure_2
The concept SegmentDelaunayGraphDataStructure_2 refines the concept ApolloniusGraphDataStructure_2. In addition it provides two methods for the merging of two vertices joined by an edge of the data structure, and the splitting of a vertex into two. The method that merges two vertices, called join_vertices() identifies the two vertices and deletes their common two faces. The method that splits a vertex, called split_vertex() introduces a new vertex that shares an edge and two faces with the old vertex (see figure below). Notice that the join_vertices() and split_vertex() operations are complementary, in the sense that one reverses the action of the other. More...

conceptSegmentDelaunayGraphHierarchyVertexBase_2
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. More...

conceptSegmentDelaunayGraphSite_2
The concept SegmentDelaunayGraphSite_2 provides the requirements for the sites of a segment Delaunay graph. More...

conceptSegmentDelaunayGraphStorageSite_2
The concept SegmentDelaunayGraphStorageSite_2 provides the requirements for the storage sites of a segment Delaunay graph. The storage sites are sites that are used to store the information of a site in a more compact form (that uses less storage). This is achieved by storing handles to points instead of points. More...

conceptSegmentDelaunayGraphTraits_2

conceptSegmentDelaunayGraphVertexBase_2