mirror of https://github.com/CGAL/cgal
Use default or Simple_cartesian kernel
This commit is contained in:
parent
5b66d3f57f
commit
810b9f0fbe
|
|
@ -1,11 +1,11 @@
|
||||||
#include <CGAL/Cartesian.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
#include <CGAL/point_generators_2.h>
|
#include <CGAL/point_generators_2.h>
|
||||||
#include <CGAL/random_convex_set_2.h>
|
#include <CGAL/random_convex_set_2.h>
|
||||||
|
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <iterator>
|
#include <iterator>
|
||||||
|
|
||||||
typedef CGAL::Cartesian< double > K;
|
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
|
||||||
typedef K::Point_2 Point_2;
|
typedef K::Point_2 Point_2;
|
||||||
typedef CGAL::Random_points_in_square_2<
|
typedef CGAL::Random_points_in_square_2<
|
||||||
Point_2,
|
Point_2,
|
||||||
|
|
|
||||||
|
|
@ -7,8 +7,8 @@
|
||||||
|
|
||||||
using namespace CGAL;
|
using namespace CGAL;
|
||||||
|
|
||||||
typedef Simple_cartesian<int> R;
|
typedef Simple_cartesian<int> K;
|
||||||
typedef R::Point_2 Point;
|
typedef K::Point_2 Point;
|
||||||
typedef Creator_uniform_2<int,Point> Creator;
|
typedef Creator_uniform_2<int,Point> Creator;
|
||||||
|
|
||||||
int main() {
|
int main() {
|
||||||
|
|
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
#include <CGAL/Cartesian.h>
|
#include <CGAL/Simple_cartesian.h>
|
||||||
#include <CGAL/Polygon_2.h>
|
#include <CGAL/Polygon_2.h>
|
||||||
#include <CGAL/point_generators_2.h>
|
#include <CGAL/point_generators_2.h>
|
||||||
#include <CGAL/random_polygon_2.h>
|
#include <CGAL/random_polygon_2.h>
|
||||||
|
|
@ -19,7 +19,7 @@ typedef double RT;
|
||||||
#include <fstream>
|
#include <fstream>
|
||||||
#include <list>
|
#include <list>
|
||||||
|
|
||||||
typedef CGAL::Cartesian<RT> K;
|
typedef CGAL::Simple_cartesian<RT> K;
|
||||||
typedef K::Point_2 Point_2;
|
typedef K::Point_2 Point_2;
|
||||||
typedef std::list<Point_2> Container;
|
typedef std::list<Point_2> Container;
|
||||||
typedef CGAL::Polygon_2<K, Container> Polygon_2;
|
typedef CGAL::Polygon_2<K, Container> Polygon_2;
|
||||||
|
|
|
||||||
|
|
@ -1,9 +1,9 @@
|
||||||
#include <CGAL/Cartesian.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
#include <CGAL/point_generators_2.h>
|
#include <CGAL/point_generators_2.h>
|
||||||
#include <CGAL/random_polygon_2.h>
|
#include <CGAL/random_polygon_2.h>
|
||||||
#include <CGAL/Polygon_2.h>
|
#include <CGAL/Polygon_2.h>
|
||||||
|
|
||||||
typedef CGAL::Cartesian< double > K;
|
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
|
||||||
typedef K::Point_2 Point_2;
|
typedef K::Point_2 Point_2;
|
||||||
typedef std::list<Point_2> Container;
|
typedef std::list<Point_2> Container;
|
||||||
typedef CGAL::Polygon_2<K, Container> Polygon_2;
|
typedef CGAL::Polygon_2<K, Container> Polygon_2;
|
||||||
|
|
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
#include <CGAL/Simple_cartesian.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
#include <cassert>
|
#include <cassert>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
|
|
@ -11,10 +11,10 @@
|
||||||
|
|
||||||
using namespace CGAL;
|
using namespace CGAL;
|
||||||
|
|
||||||
typedef Simple_cartesian<double> R;
|
typedef Exact_predicates_inexact_constructions_kernel K;
|
||||||
typedef R::Point_2 Point;
|
typedef K::Point_2 Point;
|
||||||
typedef Creator_uniform_2<double,Point> Pt_creator;
|
typedef Creator_uniform_2<double,Point> Pt_creator;
|
||||||
typedef R::Segment_2 Segment;
|
typedef K::Segment_2 Segment;
|
||||||
typedef std::vector<Segment> Vector;
|
typedef std::vector<Segment> Vector;
|
||||||
|
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,7 +1,7 @@
|
||||||
// CGAL example program for the generic segment generator
|
// CGAL example program for the generic segment generator
|
||||||
// using precomputed point locations.
|
// using precomputed point locations.
|
||||||
|
|
||||||
#include <CGAL/Simple_cartesian.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
#include <CGAL/point_generators_2.h>
|
#include <CGAL/point_generators_2.h>
|
||||||
|
|
@ -11,9 +11,9 @@
|
||||||
|
|
||||||
using namespace CGAL;
|
using namespace CGAL;
|
||||||
|
|
||||||
typedef Simple_cartesian<double> R;
|
typedef Exact_predicates_inexact_constructions_kernel K;
|
||||||
typedef R::Point_2 Point;
|
typedef K::Point_2 Point;
|
||||||
typedef R::Segment_2 Segment;
|
typedef K::Segment_2 Segment;
|
||||||
typedef Points_on_segment_2<Point> PG;
|
typedef Points_on_segment_2<Point> PG;
|
||||||
typedef Creator_uniform_2< Point, Segment> Creator;
|
typedef Creator_uniform_2< Point, Segment> Creator;
|
||||||
typedef Join_input_iterator_2< PG, PG, Creator> Segm_iterator;
|
typedef Join_input_iterator_2< PG, PG, Creator> Segm_iterator;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue