2D Segment Delaunay Graphs Reference

Todo:

check generated documentation

Menelaos Karavelas

An algorithm for computing the dual of a Voronoi diagram of a set of segments under the Euclidean metric. It is a generalization of the standard Voronoi diagram for points. The algorithms provided are dynamic.

Introduced in: CGAL 3.1
Depends on: 2D Triangulation Data Structure
BibTeX: cgal:k-sdg2-20b
License: GNU GPL
Windows Demo: 2D Segment Voronoi Diagram
Common Demo Dlls: dlls

CGAL provides the class CGAL::Segment_Delaunay_graph_2<Gt,DS> for computing the 2D Delaunay graph of segments and points. The two template parameters must be models of the SegmentDelaunayGraphTraits_2 and SegmentDelaunayGraphDataStructure_2 concepts. The first concept is related to the geometric objects and predicates associated with segment Delaunay graphs, whereas the second concept refers to the data structure used to represent the segment Delaunay graph, which is dual to the 2D Voronoi diagram of segments and points. The classes CGAL::Segment_Delaunay_graph_traits_2<K,MTag>, CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag> CGAL::Segment_Delaunay_graph_filtered_traits_2<K,MTag> CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<K,MTag> are models of the SegmentDelaunayGraphTraits_2 concept, whereas the class CGAL::Triangulation_data_structure_2<Vb,Fb> is a model of the SegmentDelaunayGraphDataStructure_2 concept.

Classified Reference Pages

Concepts

• SegmentDelaunayGraphSite_2
• SegmentDelaunayGraphStorageSite_2
• SegmentDelaunayGraphDataStructure_2
• SegmentDelaunayGraphVertexBase_2
• SegmentDelaunayGraphTraits_2
• SegmentDelaunayGraphHierarchyVertexBase_2

Classes

• CGAL::Segment_Delaunay_graph_2<Gt,DS>
• CGAL::Segment_Delaunay_graph_site_2<K>
• CGAL::Segment_Delaunay_graph_storage_site_2<Gt>
• CGAL::Segment_Delaunay_graph_vertex_base_2<Gt,SSTag>
• CGAL::Segment_Delaunay_graph_traits_2<K,MTag>
• CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>
• CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
• CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>
• CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>
• CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<Vbb>

Modules
	Concepts

Classes
class	CGAL::Segment_Delaunay_graph_2< Gt, DS >
struct	CGAL::Segment_Delaunay_graph_filtered_traits_2< CK, CM, EK, EM, FK, FM >
struct	CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2< CK, CM, EK, EM, FK, FM >
class	CGAL::Segment_Delaunay_graph_hierarchy_2< Gt, STag, DS >
class	CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2< Vbb >
class	CGAL::Segment_Delaunay_graph_site_2< K >
class	CGAL::Segment_Delaunay_graph_storage_site_2< Gt >
struct	CGAL::Segment_Delaunay_graph_traits_2< K, MTag >
struct	CGAL::Segment_Delaunay_graph_traits_without_intersections_2< K, MTag >
class	CGAL::Segment_Delaunay_graph_vertex_base_2< Gt, SSTag >