CGAL 5.6 - 2D Triangulations
Loading...
Searching...
No Matches
Triangulation_2/hierarchy.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_hierarchy_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/algorithm.h>
#include <cassert>
typedef Triangulation::Point Point;
int main( )
{
std::cout << "insertion of 1000 random points" << std::endl;
Triangulation t;
CGAL::Random_points_in_square_2<Point,Creator> g(1.);
std::copy_n( g, 1000, std::back_inserter(t));
//verbose mode of is_valid ; shows the number of vertices at each level
std::cout << "The number of vertices at successive levels" << std::endl;
assert(t.is_valid(true));
return 0;
}
The class Delaunay_triangulation_2 is designed to represent the Delaunay triangulation of a set of po...
Definition: Delaunay_triangulation_2.h:80
The class Triangulation_face_base_2 is a model for the concept TriangulationFaceBase_2.
Definition: Triangulation_face_base_2.h:31
The class Triangulation_hierarchy_2 implements a triangulation augmented with a data structure which ...
Definition: Triangulation_hierarchy_2.h:62
The class Triangulation_hierarchy_vertex_base_2 is designed to be used as a vertex base class of a tr...
Definition: Triangulation_hierarchy_2.h:100
The class Triangulation_vertex_base_2 is the default model for the concept TriangulationVertexBase_2.
Definition: Triangulation_vertex_base_2.h:34