CGAL users discussion list

[Mariette Yvinec <>]

One way to do it
is  to instantiate the triangulation with
a base cell class of type Triangulation_cell_base_with_info_3
that supports additionnal information stored in the triangulation cells.
Then you may add a boolean in each cell
to mark tetrahedra inside/outside the domain of interest.


Le 21/03/12 12:32, Juan Carlos Lopez Alfonso a écrit :

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

-- 
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis