CGAL::Segment_Delaunay_graph_traits_2<K,MTag>

Definition

The class Segment_Delaunay_graph_traits_2<K,MTag> provides a model for the SegmentDelaunayGraphTraits_2 concept. This class has two template parameters. The first template parameter must be a model of the Kernel concept. The second template parameter corresponds to how predicates are evaluated. There are two possible values for MTag, namely CGAL::Sqrt_field_tag and CGAL::Field_tag. The first one must be used when the number type used in the representation supports the exact evaluation of signs of expressions involving all four basic operations and square roots, whereas the second one requires the exact evaluation of signs of field-type expressions, i.e., expressions involving additions, subtractions, multiplications and divisions. The default value for MTag is CGAL::Field_tag. The way the predicates are evaluated is discussed in [Bur96] and [Kar04] (the geometric filtering part).

#include <CGAL/Segment_Delaunay_graph_traits_2.h>

Is Model for the Concepts

SegmentDelaunayGraphTraits_2

Types

typedef CGAL::Tag_true Intersections_tag;

The Segment_Delaunay_graph_traits_2<K,MTag> class introduces a few additional types with respect to the SegmentDelaunayGraphTraits_2 concept. These are:

typedef K Kernel; A typedef for the template parameter K.
typedef MTag Method_tag; A typedef for the template parameter MTag.

See Also

Kernel
SegmentDelaunayGraphTraits_2
CGAL::Field_tag
CGAL::Sqrt_field_tag
CGAL::Segment_Delaunay_graph_2<Gt,DS>
CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>
CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>
CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>