\( \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 5.0.1 - L Infinity Segment Delaunay Graphs
CGAL::Segment_Delaunay_graph_Linf_2< Gt, DS > Class Template Reference
L Infinity Segment Delaunay Graphs Reference

#include <CGAL/Segment_Delaunay_graph_Linf_2.h>

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

Definition

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
Gtis the geometric traits which must be a model of SegmentDelaunayGraphLinfTraits_2
DSis 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.