\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.5.1 - 2D Segment Delaunay Graphs
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]
oNCGAL
|oCSegment_Delaunay_graph_2The class Segment_Delaunay_graph_2 represents the segment Delaunay graph (which is the dual graph of the 2D segment Voronoi diagram)
|oCSegment_Delaunay_graph_filtered_traits_2The class Segment_Delaunay_graph_filtered_traits_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
|oCSegment_Delaunay_graph_filtered_traits_without_intersections_2The class Segment_Delaunay_graph_filtered_traits_without_intersections_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
|oCSegment_Delaunay_graph_hierarchy_2We provide an alternative to the class Segment_Delaunay_graph_2<Gt,DS> for the incremental construction of the segment Delaunay graph
|oCSegment_Delaunay_graph_hierarchy_vertex_base_2The class Segment_Delaunay_graph_hierarchy_vertex_base_2 provides a model for the SegmentDelaunayGraphHierarchyVertexBase_2 concept, which is the vertex base required by the Segment_Delaunay_graph_hierarchy_2<Gt,DS> class
|oCSegment_Delaunay_graph_site_2The class Segment_Delaunay_graph_site_2 is a model for the concept SegmentDelaunayGraphSite_2
|oCSegment_Delaunay_graph_storage_site_2The class Segment_Delaunay_graph_storage_site_2 is a model for the concept SegmentDelaunayGraphStorageSite_2
|oCSegment_Delaunay_graph_traits_2The class Segment_Delaunay_graph_traits_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
|oCSegment_Delaunay_graph_traits_without_intersections_2The class Segment_Delaunay_graph_traits_without_intersections_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
|\CSegment_Delaunay_graph_vertex_base_2The class Segment_Delaunay_graph_vertex_base_2 provides a model for the SegmentDelaunayGraphVertexBase_2 concept which is the vertex base required by the SegmentDelaunayGraphDataStructure_2 concept
oCSegmentDelaunayGraphDataStructure_2The 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
oCSegmentDelaunayGraphHierarchyVertexBase_2The 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
oCSegmentDelaunayGraphSite_2The concept SegmentDelaunayGraphSite_2 provides the requirements for the sites of a segment Delaunay graph
oCSegmentDelaunayGraphStorageSite_2The 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
oCSegmentDelaunayGraphTraits_2The concept SegmentDelaunayGraphTraits_2 provides the traits requirements for the Segment_Delaunay_graph_2<Gt,DS> and Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS> classes. In particular, it provides a type Site_2, which must be a model of the concept SegmentDelaunayGraphSite_2. It also provides constructions for sites and several function object types for the predicates
\CSegmentDelaunayGraphVertexBase_2The concept SegmentDelaunayGraphVertexBase_2 describes the requirements for the vertex base class of the SegmentDelaunayGraphDataStructure_2 concept. A vertex stores a site of the segment Delaunay graph and provides access to one of its incident faces through a Face_handle