|
The class Segment_Delaunay_graph_traits_without_intersections_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::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 CGAL::Ring_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>
|
|
|
|
The Segment_Delaunay_graph_traits_without_intersections_2<K,MTag> class introduces a few additional types with respect to the SegmentDelaunayGraphTraits_2 concept. These are:
|
|
| A typedef for the template parameter K. |
|
|
| A typedef for the template parameter MTag. |