CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

I think if you proceed like this, since the algorithm is incremental, 
you can end up with tetrahedra marked that are no longer degenerated.

I think the method Laurent proposed you is the best.

Sebastien.

On 03/19/2013 09:07 AM, Philipp Blanke wrote:
> Hello!
>
> I'd like to construct a Delaunay complex for a point set that contains
> several degenerate cases, i. e., >4 cospherical points. The doc says
> that the  Delaunay_triangulation_3 code solves the local disambiguity by
> using a perturbation scheme.
>
> If the tetrahedra that were constructed using this scheme would be
> marked, I could merge them in a preprocessing step to get a Delaunay
> complex consisting of convex polyhedra.
>
> Where in the code is the perturbation scheme used to select a possible
> tetrahedrization? I did not find this.
>
> Best regards,
> Philipp