CGAL 6.1.2 - L Infinity Segment Delaunay Graphs: CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2< CK, CM, EK, EM, FK, FM > Struct Template Reference

CGAL 6.1.2 - L Infinity Segment Delaunay Graphs

Loading...
Searching...
No Matches
CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2< CK, CM, EK, EM, FK, FM > Struct Template Reference
Reference Manual

`#include <CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h>`

## Definition

template<typename CK, typename CM, typename EK, typename EM, typename FK, typename FM>
struct CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2< CK, CM, EK, EM, FK, FM >

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

The class is derived from class `CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>`. We refer to the documentation of the base class `CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>` for an explanation of the template parameters. It usually enough to only specify the CK template argument and a typical value for CK is CGAL::Simple_cartesian<double> (see also the examples in the user manual).

Is model of
  `SegmentDelaunayGraphLinfTraits_2`

See also
  `CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>`
  `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_traits_without_intersections_2<K,MTag>`
  `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>`

Examples
  Segment_Delaunay_graph_Linf_2/sdg-fast-sp-linf.cpp, and Segment_Delaunay_graph_Linf_2/sdg-fast-sp-polygon-linf.cpp.