/// \defgroup PkgSegmentDelaunayGraph2Ref Reference Manual
/// \defgroup PkgSegmentDelaunayGraph2Concepts Concepts
/// \ingroup PkgSegmentDelaunayGraph2Ref
/*!
\addtogroup PkgSegmentDelaunayGraph2Ref
\cgalPkgDescriptionBegin{2D Segment Delaunay Graphs,PkgSegmentDelaunayGraph2}
\cgalPkgPicture{svd.png}
\cgalPkgSummaryBegin
\cgalPkgAuthor{Menelaos Karavelas}
\cgalPkgDesc{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.}
\cgalPkgManuals{Chapter_2D_Segment_Delaunay_Graphs,PkgSegmentDelaunayGraph2Ref}
\cgalPkgSummaryEnd
\cgalPkgShortInfoBegin
\cgalPkgSince{3.1}
\cgalPkgDependsOn{\ref PkgTDS2}
\cgalPkgBib{cgal:k-sdg2}
\cgalPkgLicense{\ref licensesGPL}
\cgalPkgDemo{2D Segment Voronoi Diagram,segment_voronoi_diagram_2.zip}
\cgalPkgShortInfoEnd
\cgalPkgDescriptionEnd

\cgal provides the class `CGAL::Segment_Delaunay_graph_2<Gt,St,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.

\cgalClassifedRefPages

\cgalCRPSection{Concepts}

- `SegmentDelaunayGraphSite_2`
- `SegmentDelaunayGraphStorageSite_2`
- `SegmentDelaunayGraphStorageTraits_2`
- `SegmentDelaunayGraphDataStructure_2`
- `SegmentDelaunayGraphVertexBase_2`
- `SegmentDelaunayGraphFaceBase_2`
- `SegmentDelaunayGraphTraits_2`
- `SegmentDelaunayGraphHierarchyVertexBase_2`

\cgalCRPSection{Classes}

- `CGAL::Segment_Delaunay_graph_2<Gt,St,DS>`
- `CGAL::Segment_Delaunay_graph_site_2<K>`
- `CGAL::Segment_Delaunay_graph_storage_site_2<Gt>`
- `CGAL::Segment_Delaunay_graph_storage_site_with_info_2<St,I,B>`
- `CGAL::Segment_Delaunay_graph_storage_traits_2<Gt>`
- `CGAL::Segment_Delaunay_graph_storage_traits_with_info_2<Gt,I,C,M>`
- `CGAL::Segment_Delaunay_graph_vertex_base_2<St,Vb>`
- `CGAL::Segment_Delaunay_graph_face_base_2<Gt,Fb>`
- `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,St,STag,DS>`
- `CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<Vbb>`

*/
