#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Delaunay_triangulation_3.h>
#include <CGAL/Delaunay_triangulation_cell_base_3.h>
#include <CGAL/Triangulation_vertex_base_with_info_3.h>
#include <CGAL/IO/Color.h>
typedef Delaunay::Point Point;
int main()
{
Delaunay T;
T.insert(Point(1,0,0));
T.insert(Point(0,1,0));
T.insert(Point(0,0,1));
T.insert(Point(2,2,2));
T.insert(Point(-1,0,1));
Delaunay::Finite_vertices_iterator vit;
for (Delaunay::Vertex_handle v : T.finite_vertex_handles())
if (T.degree(v) == 6)
v->info() = CGAL::IO::red();
return 0;
}
The class Delaunay_triangulation_3 represents a three-dimensional Delaunay triangulation.
Definition: Delaunay_triangulation_3.h:65
Vertex_handle insert(const Point &p, Cell_handle start=Cell_handle(), bool *could_lock_zone=nullptr)
Inserts the point p in the triangulation and returns the corresponding vertex.
The class Delaunay_triangulation_cell_base_3 is a model of the concept DelaunayTriangulationCellBase_...
Definition: Delaunay_triangulation_cell_base_3.h:26
The class Triangulation_vertex_base_with_info_3 is a model of the concept TriangulationVertexBase_3,...
Definition: Triangulation_vertex_base_with_info_3.h:29