1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Delaunay_triangulation_3.h>
#include <CGAL/point_generators_3.h>
#include <CGAL/Timer.h>
#include <iostream>
#include <fstream>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef K::Point_3 Point;
typedef CGAL::Timer Timer;
const int NUM_INSERTED_POINTS = 10000;
int main()
{
CGAL::Random_points_in_cube_3<Point> rnd(1.);
std::cerr << "Construction of a 3D Delaunay triangulation from a vector of "
<< NUM_INSERTED_POINTS << " random points in a cube" << std::endl;
std::vector<Point> V;
V.reserve(NUM_INSERTED_POINTS);
for (int i = 0; i != NUM_INSERTED_POINTS; ++i)
V.push_back(*rnd++);
// Sequential Delaunay T3
typedef CGAL::Delaunay_triangulation_3<K> SequentialTriangulation;
Timer t;
t.start();
SequentialTriangulation S(V.begin(), V.end());
t.stop();
std::cerr << "Sequential construction takes " << t.time() << " sec." << std::endl;
// Parallel Delaunay T3
#ifdef CGAL_LINKED_WITH_TBB
typedef CGAL::Triangulation_data_structure_3<
CGAL::Triangulation_vertex_base_3<K>,
CGAL::Triangulation_cell_base_3<K>,
CGAL::Parallel_tag> ParallelTds;
typedef CGAL::Delaunay_triangulation_3<K, ParallelTds> ParallelTriangulation;
t.reset();
t.start();
// Construct the locking data-structure, using the bounding-box of the points
ParallelTriangulation::Lock_data_structure locking_ds(
CGAL::Bbox_3(-1., -1., -1., 1., 1., 1.), 50);
// Construct the triangulation in parallel
ParallelTriangulation T(V.begin(), V.end(), &locking_ds);
t.stop();
std::cerr << "Parallel construction takes " << t.time() << " sec. with "
<< tbb::task_scheduler_init::default_num_threads() << " threads" << std::endl;
#endif
return 0;
}
|
