There are six versions of the function template range_search that
perform range searches on Delaunay triangulations. The first performs
circular range searches, the second triangular range searches and the
third performs isorectangular range searches. The other three range search
function templates perform enhanced variants of the three aforementioned
operations.
They get a userdefined object that has to control the range search operation.
This way one can for instance stop the search, when $$n points were found.
#include <CGAL/range_search_delaunay_2.h>
 

 
computes handles to all vertices contained in the closure of the isorectangle $$(a,b,c,d).

 

 
computes handles to all vertices contained in the closure of disk $$C. The computed vertex handles will be placed as a sequence of objects in a container of value type of $$res which points to the first object in the sequence. The function returns an output iterator pointing to the position beyond the end of the sequence. $$delau is the CGAL Delaunay triangulation on that we perform the range search operation. $$pred controls the search operation. If $$return_if_succeded is $$true, we will end the search after the first success of the predicate, otherwise we will continue till the search is finished. 
 

 
computes handles to all vertices contained in the closure of the triangle $$(a,b,c).

 

 
computes handles to all vertices contained in the closure of the isorectangle $$(a,b,c,d).
