CGAL::Segment_Delaunay_graph_traits_without_intersections_2< K, MTag > Struct Template Reference

#include <CGAL/Segment_Delaunay_graph_traits_2.h>

Definition

The class Segment_Delaunay_graph_traits_without_intersections_2 provides a model for the SegmentDelaunayGraphTraits_2 concept.

Template Parameters

K

must be a model of the Kernel concept.

MTag

corresponds to how predicates are evaluated. There are two possible values for MTag, namely Field_with_sqrt_tag and Euclidean_ring_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 ring-type expressions, i.e., expressions involving only additions, subtractions and multiplications. The default value for MTag is Euclidean_ring_tag. The way the predicates are evaluated is discussed in [2] and [4] (the geometric filtering part).

Is Model Of:

SegmentDelaunayGraphTraits_2

See also

Kernel

SegmentDelaunayGraphTraits_2

CGAL::Euclidean_ring_tag

CGAL::Field_with_sqrt_tag

CGAL::Segment_Delaunay_graph_2<Gt,DS>

CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>

CGAL::Segment_Delaunay_graph_traits_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>

Types
typedef CGAL::Tag_false	Intersections_tag

Additional Types
The Segment_Delaunay_graph_traits_without_intersections_2 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.