CGAL 6.2 - L Infinity Segment Delaunay Graphs: CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2< K, MTag > Struct Template Reference

CGAL 6.2 - L Infinity Segment Delaunay Graphs

Loading...
Searching...
No Matches
CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2< K, MTag > Struct Template Reference
Reference Manual

`#include <CGAL/Segment_Delaunay_graph_Linf_traits_2.h>`

## Definition

template<typename K, typename MTag>
struct CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2< K, MTag >

The class `Segment_Delaunay_graph_Linf_traits_without_intersections_2` provides a model for the `SegmentDelaunayGraphLinfTraits_2` concept.

The class is derived from class `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>`. We refer to the documentation of the base class `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>` for an explanation of the template parameters. Our experience has shown that the `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_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_without_intersections_2`.

Is model of
  `SegmentDelaunayGraphLinfTraits_2`

See also
  `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>`
  `CGAL::Segment_Delaunay_graph_2<Gt,DS>`
  `CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>`
  `CGAL::Segment_Delaunay_graph_Linf_traits_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>`