CGAL users discussion list

[Juan Carlos Lopez Alfonso <>]

Hi all,

I have a question related with a delaunay triangulation. I have
triangulated a set of points and I want to know how I can remove some
tetrahedrons of this triangulation.

For example I have the following triangulation: Delaunay T;
and I have iterated over all tetrahedrons and when one edge of one of
them is more than a defined threshold, I want to eliminate this
tetraheron of T. The idea is eliminate external tetrahedrons in order
to obtain a nonconvex domain triangulation. I need eliminate this
tetrahedrons of T, because I need to iterate the set of tetrahedrons
which are incident in the infinite vertex. Some thing like this:

T.incident_cells(T.infinite_vertex(), std::back_inserter(infinite_cells));

Is there any form to eliminate tetrahedrons of T?

Best regards
Juan Carlos