CGAL users discussion list

[Adam Getchell <>]

Hello all,

I am storing some timeslice data in each vertex of a 3D Delaunay 
triangulation, and then ensuring that each cell is correctly foliated (i.e. 
maximum timeslice - minimum timeslice == 1).

For those cells that fail this criteria, I delete them using 
tds().delete_cell(cit).

https://github.com/acgetchell/CDT-plusplus/blob/master/src/S3Triangulation.h

However, this produces an invalid triangulation.

How do I fix these holes?

As an alternative approach, instead of using delete_cell() defined on the 
triangulation data structure, I can iterate over the vertices in each cell 
and individually remove them using the remove(cit->vertex(i)) function 
defined on the Delaunay triangulation. This results in valid triangulations 
for large number of cells, but also removed all vertices for small number of 
cells (such as two tetrahedrons), and also doesn’t seem to delete all 
invalidly foliated triangulations.

Is this generally a better approach, or is there an easy way to fix up the 
missing cells?

Thanks for any advice.

Adam Getchell
about.me/adamgetchell