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 123]

▼NCGAL
CSegment_Delaunay_graph_2	The class Segment_Delaunay_graph_2 represents the segment Delaunay graph (which is the dual graph of the 2D segment Voronoi diagram)
CSegment_Delaunay_graph_face_base_2
CSegment_Delaunay_graph_filtered_traits_2	The class Segment_Delaunay_graph_filtered_traits_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
CSegment_Delaunay_graph_filtered_traits_without_intersections_2	The class Segment_Delaunay_graph_filtered_traits_without_intersections_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
CSegment_Delaunay_graph_hierarchy_2	We provide an alternative to the class Segment_Delaunay_graph_2<Gt,St,DS> for the incremental construction of the segment Delaunay graph
CSegment_Delaunay_graph_hierarchy_vertex_base_2	The 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,St,STag,DS> class
CSegment_Delaunay_graph_site_2	The class Segment_Delaunay_graph_site_2 is a model for the concept SegmentDelaunayGraphSite_2
CSegment_Delaunay_graph_storage_site_2	The class Segment_Delaunay_graph_storage_site_2 is a model for the concept SegmentDelaunayGraphStorageSite_2
▼CSegment_Delaunay_graph_storage_site_with_info_2	The class Segment_Delaunay_graph_storage_site_with_info_2 is a model for the concept SegmentDelaunayGraphStorageSite_2
CHas_info_tag
CSegment_Delaunay_graph_storage_traits_2	The class Segment_Delaunay_graph_storage_traits_2 provides a model for the SegmentDelaunayGraphStorageTraits_2 concept
CSegment_Delaunay_graph_storage_traits_with_info_2	The class Segment_Delaunay_graph_storage_traits_with_info_2 provides a model for the SegmentDelaunayGraphStorageTraits_2 concept
CSegment_Delaunay_graph_traits_2	The class Segment_Delaunay_graph_traits_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
CSegment_Delaunay_graph_traits_without_intersections_2	The class Segment_Delaunay_graph_traits_without_intersections_2 provides a model for the SegmentDelaunayGraphTraits_2 concept
CSegment_Delaunay_graph_vertex_base_2
CSegmentDelaunayGraphDataStructure_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
CSegmentDelaunayGraphFaceBase_2	The concept SegmentDelaunayGraphFaceBase_2 describes the requirements for the face base class of the SegmentDelaunayGraphDataStructure_2 concept
CSegmentDelaunayGraphHierarchyVertexBase_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 preceding levels. Therefore, the concept SegmentDelaunayGraphHierarchyVertexBase_2 refines the concept SegmentDelaunayGraphVertexBase_2, by adding two vertex handles to the corresponding vertices for the next and previous level graphs
CSegmentDelaunayGraphSite_2	The concept SegmentDelaunayGraphSite_2 provides the requirements for the sites of a segment Delaunay graph
CSegmentDelaunayGraphStorageSite_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
CSegmentDelaunayGraphStorageTraits_2	The concept SegmentDelaunayGraphStorageTraits_2 provides the requirements for the storage traits of a segment Delaunay graph
CSegmentDelaunayGraphTraits_2
CSegmentDelaunayGraphVertexBase_2