The class Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM> provides a model for the SegmentDelaunayGraphTraits_2 concept.

The class Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM> uses the filtering technique [BBP01] to achieve traits for the Segment_Delaunay_graph_2<Gt,DS> class with efficient and exact predicates given an exact kernel EK and a filtering kernel FK. The geometric constructions associated provided by this class are equivalent to those provided by the traits class Segment_Delaunay_graph_traits_without_intersections_2<CK,CM>, which means that they may be inexact, depending on the choice of the CK kernel.

This class has six template parameters. The first, third and fifth template parameters must be a models of the Kernel concept. The parameter CK is the construction kernel and it is the kernel that will be used for constructions. The parameter FK is the filtering kernel; this kernel will be used for performing the arithmetic filtering for the predicates involved in the computation of the segment Delaunay graph. Finally, the parameter EK is the exact kernel; this kernel will be used for computing the predicates if the filtering kernel fails to produce an answer.

The second, fourth and sixth template parameters correspond to how predicates are evaluated. There are two predefined possible values for these parameters, namely CGAL::Sqrt_field_tag and CGAL::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 requires the exact evaluation of signs of ring-type expressions, i.e., expressions involving only additions, subtractions and multiplications. Finally, in order to get exact constructions CM must be set to CGAL::Sqrt_field_tag and the number type in CK must support operations involing divisions and square roots (as well as the other three basic operations of course). The way the predicates are evaluated is discussed in [Bur96] and [Kar04] (the geometric filtering part).

The default values for the template parameters are as follows: CM = CGAL::Sqrt_field_tag (it is assumed that CGAL::Cartesian<double> or CGAL::Simple_cartesian<double> will be the entry for the template parameter CK), EM = CGAL::Ring_tag, FK = CGAL::Simple_cartesian<CGAL::Interval_nt<false> >, FM = CGAL::Sqrt_field_tag. If the GMP package is installed with CGAL, the template parameter EK has the default value: EK = CGAL::Simple_cartesian<CGAL::Gmpq>, otherwise its default value is EK = CGAL::Simple_cartesian<CGAL::MP_Float>.

#include <CGAL/Segment_Delaunay_graph_filtered_traits_2.h>

Is Model for the Concepts



typedef CGAL::Tag_false Intersections_tag;

In addition to the types required by the SegmentDelaunayGraphTraits_2 concept the class Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM> defines the following types:

typedef CK Kernel;
typedef CK Construction_kernel;
typedef FK Filtering_kernel;
typedef EK Exact_kernel;
typedef CM Method_tag;
typedef CM Construction_traits_method_tag;
typedef FM Filtering_traits_method_tag;
typedef EM Exact_traits_method_tag;
A type for the segment Delaunay graph traits, where the kernel is CK.

A type for the segment Delaunay graph traits, where the kernel is FK.

A type for the segment Delaunay graph traits, where the kernel is EK.

See Also