\( \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.3 - L Infinity Segment Delaunay Graphs
CGAL::Segment_Delaunay_graph_Linf_traits_2< K, MTag > Struct Template Reference
L Infinity Segment Delaunay Graphs Reference

#include <CGAL/Segment_Delaunay_graph_Linf_traits_2.h>

Definition

The class Segment_Delaunay_graph_Linf_traits_2 provides a model for the SegmentDelaunayGraphLinfTraits_2 concept.

The class is derived from class CGAL::Segment_Delaunay_graph_traits_2<K,MTag>. We refer to the documentation of the base class CGAL::Segment_Delaunay_graph_traits_2<K,MTag> for an explanation of the template parameters. Our experience has shown that the CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM> class is more efficient for all reasonable and valid values of the template parameters and should be preferred over Segment_Delaunay_graph_Linf_traits_2.

Is Model Of:
SegmentDelaunayGraphLinfTraits_2
See also
CGAL::Segment_Delaunay_graph_traits_2<K,MTag>
CGAL::Segment_Delaunay_graph_Linf_2<Gt,DS>
CGAL::Segment_Delaunay_graph_Linf_hierarchy_2<Gt,STag,DS>
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-voronoi-edges-linf.cpp.