mirror of https://github.com/CGAL/cgal
79 lines
2.5 KiB
C++
79 lines
2.5 KiB
C++
#if defined(__GNUC__) && defined(__GNUC_MINOR__) && (__GNUC__ <= 4) && (__GNUC_MINOR__ < 4)
|
|
|
|
#include <iostream>
|
|
int main()
|
|
{
|
|
std::cerr << "NOTICE: This test requires G++ >= 4.4, and will not be compiled." << std::endl;
|
|
}
|
|
|
|
#else
|
|
|
|
#include <CGAL/Epick_d.h>
|
|
#include <CGAL/point_generators_d.h>
|
|
#include <CGAL/Delaunay_triangulation.h>
|
|
#include <CGAL/algorithm.h>
|
|
#include <CGAL/Timer.h>
|
|
#include <CGAL/assertions.h>
|
|
|
|
#include <iostream>
|
|
#include <iterator>
|
|
#include <vector>
|
|
|
|
const int D=5;
|
|
typedef CGAL::Epick_d< CGAL::Dimension_tag<D> > K;
|
|
typedef CGAL::Delaunay_triangulation<K> T;
|
|
// The triangulation uses the default instanciation of the
|
|
// TriangulationDataStructure template parameter
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int N = 100; if( argc > 2 )N = atoi(argv[1]); // number of points
|
|
CGAL::Timer cost; // timer
|
|
|
|
// Instanciate a random point generator
|
|
CGAL::Random rng(0);
|
|
typedef CGAL::Random_points_in_cube_d<T::Point> Random_points_iterator;
|
|
Random_points_iterator rand_it(D, 1.0, rng);
|
|
// Generate N random points
|
|
std::vector<T::Point> points;
|
|
CGAL::cpp11::copy_n(rand_it, N, std::back_inserter(points));
|
|
|
|
T t(D);
|
|
CGAL_assertion(t.empty());
|
|
|
|
// insert the points in the triangulation
|
|
cost.reset();cost.start();
|
|
std::cout << " Delaunay triangulation of "<<N<<" points in dim "<<D<< std::flush;
|
|
t.insert(points.begin(), points.end());
|
|
std::cout << " done in "<<cost.time()<<" seconds." << std::endl;
|
|
CGAL_assertion( t.is_valid() );
|
|
|
|
// insert with special operations in conflict zone and new created cells
|
|
cost.reset();
|
|
std::cout << " adding "<<N<<" other points "<< std::endl;
|
|
for(int i=0; i<N; ++i)
|
|
{
|
|
T::Vertex_handle v;
|
|
T::Face f(t.current_dimension());
|
|
T::Facet ft;
|
|
T::Full_cell_handle c;
|
|
T::Locate_type lt;
|
|
typedef std::vector<T::Full_cell_handle> Full_cells;
|
|
Full_cells zone, new_full_cells;
|
|
std::back_insert_iterator<Full_cells> out(zone);
|
|
c = t.locate(*++rand_it, lt, f, ft, v);
|
|
// previously inserted vertex v is used as hint for point location (if defined)
|
|
T::Facet ftc = t.compute_conflict_zone(*rand_it, c, out);
|
|
std::cout<<i<<" conflict zone of size "<<zone.size()<<" -> "<<std::flush;
|
|
out = std::back_inserter(new_full_cells);
|
|
CGAL_assertion( t.is_valid() );
|
|
v = t.insert_in_hole(*rand_it, zone.begin(), zone.end(), ftc, out);
|
|
std::cout<<new_full_cells.size()<<" new cells"<<std::endl;
|
|
}
|
|
|
|
std::cout << " done in "<<cost.time()<<" seconds." << std::endl;
|
|
return 0;
|
|
}
|
|
|
|
#endif
|