mirror of https://github.com/CGAL/cgal
examples 3 and 4 now use the filtered traits
This commit is contained in:
parent
de0abade01
commit
650aeedd6d
|
|
@ -17,14 +17,7 @@
|
|||
#include <CGAL/Simple_cartesian.h>
|
||||
|
||||
// inexact kernel
|
||||
typedef CGAL::Simple_cartesian<double> CK;
|
||||
|
||||
// exact kernel
|
||||
typedef CGAL::Simple_cartesian<CGAL::MP_Float> EK;
|
||||
|
||||
|
||||
typedef CGAL::Filtered_kernel<CK> Kernel;
|
||||
|
||||
typedef CGAL::Simple_cartesian<double> Kernel;
|
||||
|
||||
// typedefs for the traits and the algorithm
|
||||
|
||||
|
|
@ -34,7 +27,8 @@ typedef CGAL::Filtered_kernel<CK> Kernel;
|
|||
#include <CGAL/Apollonius_graph_face_base_2.h>
|
||||
#include <CGAL/Apollonius_graph_traits_2.h>
|
||||
|
||||
typedef CGAL::Apollonius_graph_traits_2<Kernel> Traits;
|
||||
// using filtered traits
|
||||
typedef CGAL::Apollonius_graph_filtered_traits_2<Kernel> Traits;
|
||||
|
||||
// with the second template argument in the vertex base class being
|
||||
// false, we indicate that there is no need to store the hidden
|
||||
|
|
|
|||
|
|
@ -20,18 +20,19 @@ typedef CGAL::Simple_cartesian<double> CK;
|
|||
// exact kernel
|
||||
typedef CGAL::Simple_cartesian<CGAL::MP_Float> EK;
|
||||
|
||||
// SAME COMMENT HERE; I WILL RESTORE IT WHEN FILTERED KERNEL WORKS
|
||||
//typedef CGAL::Filtered_kernel<CK,EK> Kernel;
|
||||
typedef CGAL::Filtered_kernel<CK> Kernel;
|
||||
|
||||
|
||||
|
||||
// typedefs for the traits and the algorithm
|
||||
|
||||
#include <CGAL/Apollonius_graph_hierarchy_2.h>
|
||||
#include <CGAL/Apollonius_graph_traits_2.h>
|
||||
|
||||
typedef CGAL::Apollonius_graph_traits_2<Kernel> Traits;
|
||||
|
||||
// using filtered traits with two different methods for computing the
|
||||
// predicates
|
||||
typedef
|
||||
CGAL::Apollonius_graph_filtered_traits_2<CK, CGAL::Sqrt_field_tag,
|
||||
EK, CGAL::Ring_tag>
|
||||
Traits;
|
||||
|
||||
// now we use the Apollonius graph hierarchy.
|
||||
// the hierarchy is faster for inputs consisting of about more than
|
||||
|
|
|
|||
Loading…
Reference in New Issue