CGAL users discussion list

["Marek" <>]

hi
my name is Marek
 i have question about Constrained_Delaunay_Triangulation_2. With some input
data stack got overflowed with conflict propagations:

template <class OutputItFaces, class OutputItBoundaryEdges>
 std::pair<OutputItFaces,OutputItBoundaryEdges>
 propagate_conflicts (const Point  &p,
              Face_handle fh,
              int i,
              std::pair<OutputItFaces,OutputItBoundaryEdges>  pit)  const

in some sort of infinite recursion

In my example I have geometry with features very close to each other ( inner
segment very close to meshing polygon contour segment), could you advise me
how can I made myself sure stack wont overflow for any geometry? I would like
to somehow detect that my geometry cant be meshed or use some tools to
preprocess it to be 100% sure it wont stuck.

also in this topic:
https://sympa.inria.fr/sympa/arc/cgal-discuss/2011-05/msg00172.html
I read that "There have been some work done in Triangulation_2 and
Triangulation_3, during the last two releases, because there was recursive
functions to compute the conflict zone of new point, and we removed those
recursions" , could u give me some more insights? I'm currently using CGAL 3.9
because company I work for have commercial license for it.

Marek