CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Could you try with CGAL::No_intersection_tag ?

Sebastien.

On 05/16/2013 03:14 PM, Yohann wrote:
> Turns out the minimal example is hard to build. I'm still working on it.
>
> What I have so far boils down to the following steps:
>
> for each polygon (list of (x,y)) of some list (many thousands)
>   instanciate a contrained 2d triangulation
>   insert the points in it
> end
>
> This crashes when the iteration reaches a specific polygon (that has a
> duplicated point, but it's not the first polygon alike encountered during the
> iteration). Somehow, if I start the iteration straight at this polygon,
> everything goes fine, which is weird because the triangulation object is
> reinstanciated after each iteration anyway.
> If I remove all the polygons that have a duplicated point before hand, there's
> no crash at all (basically, it also works if I only remove the very polygon
> that crashes the for loop).
>
> I'm well aware this is not helping you much, I was hoping it might give you a
> clue of what is happening that would point me in a relevant direction towards
> a minimal example.
> Here's the kernel and general configuration that I am using though:
>      typedef CGAL::Exact_predicates_inexact_constructions_kernel T_CgalKernel;
>      typedef CGAL::Triangulation_vertex_base_2<T_CgalKernel>  
> T_TriangulationVb;
>      typedef CGAL::Constrained_triangulation_face_base_2<T_CgalKernel>
> T_TriangulationFb;
>      typedef
> CGAL::Triangulation_data_structure_2<T_TriangulationVb,T_TriangulationFb>
> T_TriangulationTds;
>      typedef CGAL::Exact_predicates_tag T_TriangulationItag;
>      typedef
> CGAL::Constrained_Delaunay_triangulation_2<T_CgalKernel,T_TriangulationTds,T_TriangulationItag>
> T_Triangulation;
>
> I'll come back to you when I have something that doesn't involve 55000 polygon
> insertions before crashing.
>
> Thanks