CGAL users discussion list

[Richard Kogelnig <>]

Hello list,
I am wondering about the time complexity to turn a Constrained Delaunay 
Triangulation into a conforming Gabriel one by using 
CGAL::make_conforming_Gabriel_2(cdt);.
How many Steiner points will be added in the worst case?
Could someone point out a "cite-able" paper which describes the complexity?

best regard
and thanks to all developers for CGAL,
r

P.S.: please excuse a potential dublication of this message (forum 
interface vs mailing list)