CGAL users discussion list

[Marius Kintel <>]

Hey,

An update: Replacing my tessellation code with the GLU tessellator solves all 
stability issues.
However, as the GLU tessellator naively build triangle fans after 
decomposition, it’s far from being delaunay, and it tends to introduce zero 
triangles (collinear vertices), which do not pass CGAL’s Polyhedron_3 
preconditions.

Now, If I could just bypass Polyhedron_3 altogether. Does anyone happen to 
have an example of how to create a Nef polyhedron directly from e.g. OFF 
without going through a Polyhedron_3 ?

 -Marius

On Jan 6, 2015, at 22:41 PM, Marius Kintel 
<>
 wrote:

> Hi again,
> 
> After looking more carefully at the code, I see that I do pass 
> CGAL::Exact_predicates_tag as a tag to the CDT. As far as I understand, 
> this means that the CDT should be robust wrt. intersecting constraints.
> Does that mean that I found a bug in CDT? If so, I can provide a minimal 
> test program which breaks a stand-alone CDT.
> 
> -Marius
>