CGAL users discussion list

[Juan Carlos Lopez Alfonso <>]

Hi there:

I have a problem with a 3D triangulation. I have the following code:

#include <CGAL/Delaunay_triangulation_3.h>

typedef CGAL::Delaunay_triangulation_3<K, Tds>  Delaunay;

typedef Delaunay::Cell_handle    Cell_handle;

typedef Delaunay::Vertex_handle  Vertex_handle;

typedef Delaunay::Locate_type    Locate_type;

typedef Delaunay::Point          Point;

typedef Delaunay::size_type      size_type;

typedef Delaunay::Finite_vertices_iterator  Finite_vertices_iterator;

typedef Delaunay::Finite_cells_iterator Finite_cells_iterator;

...

Delaunay T;

T.insert(L.begin(), L.end());

for(Finite_cells_iterator cit = T.finite_cells_begin(), end = T.finite_cells_end(); cit != end; ++cit)

{

     ... coplanar points ...

}

...

where L is a list of 3D points. When I run my code, I have detected that there are several tetrahedra which its 4 points are coplanar.

Could anyone help me to solve this problem? I need a triangulation where all tetrahedra has no its 4 points in the same plane.

Thank you in advance and waiting for a suggestion

Juan Carlos