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 iso-rectangular range searches. The other three range search function templates perform enhanced variants of the three aforementioned operations.

They get a user-defined object that has to control the range search operation. This way one can for instance stop the search, when n points were found.

Functions
OutputIterator	CGAL::range_search (Dt &delau, const Circle &C, OutputIterator res)
	computes handles to all vertices contained in the closure of disk `C`. More...

OutputIterator	CGAL::range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, OutputIterator res)
	computes handles to all vertices contained in the closure of the triangle `(a,b,c)`. More...

OutputIterator	CGAL::range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, const Dt::Point &d, OutputIterator res)
	computes handles to all vertices contained in the closure of the iso-rectangle `(a,b,c,d)`. More...

OutputIterator	CGAL::range_search (Dt &delau, const Circle &C, OutputIterator res, Pred &pred, bool return_if_succeded)
	computes handles to all vertices contained in the closure of disk `C`. More...

OutputIterator	CGAL::range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, OutputIterator res, Pred &pred, bool return_if_succeded)
	computes handles to all vertices contained in the closure of the triangle `(a,b,c)`. More...

OutputIterator	CGAL::range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, const Dt::Point &d, OutputIterator res, Pred &pred, bool return_if_succeded)
	computes handles to all vertices contained in the closure of the iso-rectangle `(a,b,c,d)`. More...

Functions