CGAL users discussion list

[Stefan Salewski <>]

I just tried to add a range search function to my ruby interface code of
cgals constrained delaunay triangulation
(http://www.ssalewski.de/CDT.html.en).

Seems to work, as long as there are no constraints inserted prior to
calling range search. Is this restriction intended -- or I am doing
something wrong?

With constrains, I get this message:

range search 8,8, 3
terminate called after throwing an instance of
'CGAL::Precondition_exception'
  what():  CGAL ERROR: precondition violation!
Expr: ! are_there_incident_constraints(v)
File: /usr/include/CGAL/Constrained_Delaunay_triangulation_2.h

I guess that is not a big problem for me, I should be able to do all
searching prior to inserting constraints.

Does this restriction apply to nearest neighbor search also?

One more question -- I found this 

http://cgal-discuss.949826.n4.nabble.com/range-search-problem-td953126.html

Sep 21, 2009; 2:32pm
>when I tried to call range_search, the delaunay mesh changes!(some edge
>flippling

Is it true, that range search can modify the triangulation structure?

Best regards,

Stefan Salewski