CGAL 6.2 - L Infinity Segment Delaunay Graphs: CGAL::Segment_Delaunay_graph_Linf_2< Gt, DS > Class Template Reference

CGAL 6.2 - L Infinity Segment Delaunay Graphs

Loading...
Searching...
No Matches
CGAL::Segment_Delaunay_graph_Linf_2< Gt, DS > Class Template Reference
Reference Manual

`#include <CGAL/Segment_Delaunay_graph_Linf_2.h>`

Inherited by CGAL::Segment_Delaunay_graph_Linf_hierarchy_2< Gt, STag, DS >.

## Definition

template<typename Gt, typename DS>
class CGAL::Segment_Delaunay_graph_Linf_2< Gt, DS >

The class `Segment_Delaunay_graph_Linf_2` represents the segment Delaunay graph under the \( L_{\infty} \) metric (which is the dual graph of the 2D segment Voronoi diagram under the \( L_{\infty} \) metric).

This class is derived from class `CGAL::Segment_Delaunay_graph_2<Gt,DS>`. Currently, deletion of sites is not supported.

Template Parameters

  Gt | is the geometric traits which must be a model of `SegmentDelaunayGraphLinfTraits_2`
  DS | is the segment Delaunay graph data structure which must be a model of `SegmentDelaunayGraphDataStructure_2`. `DS` defaults to `CGAL::Triangulation_data_structure_2< CGAL::Segment_Delaunay_graph_vertex_base_2<Gt>, CGAL::Triangulation_face_base_2<Gt> >`.

Is model of
  `DelaunayGraph_2`

See also
  `SegmentDelaunayGraphLinfTraits_2`
  `SegmentDelaunayGraphDataStructure_2`
  `CGAL::Segment_Delaunay_graph_Linf_hierarchy_2<Gt,STag,DS>`
  `CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>`
  `CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>`
  `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
  `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>`

Examples
  Segment_Delaunay_graph_Linf_2/sdg-count-sites-linf.cpp, Segment_Delaunay_graph_Linf_2/sdg-fast-sp-linf.cpp, Segment_Delaunay_graph_Linf_2/sdg-fast-sp-polygon-linf.cpp, Segment_Delaunay_graph_Linf_2/sdg-red-blue-info-linf.cpp, and Segment_Delaunay_graph_Linf_2/sdg-voronoi-edges-linf.cpp.