CGAL::range_search

Definition

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 beforementioned 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.

#include <CGAL/range_search_delaunay_2.h>

template<class Dt, class Circle, class OutputIterator>
OutputIterator	range_search ( Dt& delau, Circle C, OutputIterator res)
		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 which we perform the range search operation.

Requirements

• Dt is a CGAL Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from the Delaunay triangulation data type:
  • Dt::Geom_traits
  • Dt::Vertex_handle
  • Dt::Vertex
  • Dt::Vertex_circulator
  • Dt::Vertex_iterator
  • Dt::Point
  • Dt::Geom_traits::Bounded_side_2
  • Dt::Geom_traits::Construct_center_2
• the template parameter Circle corresponds to Dt::Geom_traits::Cricle_2

template<class Dt, class OutputIterator>
OutputIterator	range_search ( Dt& delau, Dt::Point a, Dt::Point b, Dt::Point c, OutputIterator res)
		computes handles to all vertices contained in the closure of the triangle $$(a,b,c). Precondition: $$a, $$b, and $$c must not be collinear. 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 which we perform the range search operation.

Requirements

• Dt::Geom_traits
• Dt::Vertex_handle
• Dt::Vertex
• Dt::Vertex_circulator
• Dt::Vertex_iterator
• Dt::Point
• Dt::Geom_traits::Circle_2
• Dt::Geom_traits::Bounded_side_2
• Dt::Geom_traits::Construct_center_2
• Dt::Geom_traits::Orientation_2
• Dt::Geom_traits::Construct_circle_2

template<class Dt, class OutputIterator>
OutputIterator	range_search ( Dt& delau, Dt::Point a, Dt::Point b, Dt::Point c, Dt::Point d, OutputIterator res)
		computes handles to all vertices contained in the closure of the iso-rectangle $$(a,b,c,d). Precondition: $$a is the upper left point, $$b the lower left, $$c the lower right and $$d the upper right point of the iso rectangle. 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 which we perform the range search operation.

Requirements

• Dt::Geom_traits
• Dt::Vertex_handle
• Dt::Vertex
• Dt::Vertex_circulator
• Dt::Vertex_iterator
• Dt::Point
• Dt::Geom_traits::Circle_2
• Dt::Geom_traits::Bounded_side_2
• Dt::Geom_traits::Construct_center_2
• Dt::Geom_traits::Orientation_2
• Dt::Geom_traits::Construct_circle_2

template<class Dt, class Circle, class OutputIterator, class Pred>
OutputIterator	range_search ( Dt& delau, Circle C, OutputIterator res, Pred& pred, bool return_if_succeded)
		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.

Requirements

• void set_result(bool);
• bool operator()(const Point&);

template<class Dt, class OutputIterator, class Pred>
OutputIterator	range_search ( Dt& delau, Dt::Point a, Dt::Point b, 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). Precondition: $$a, $$b, and $$c must not be collinear. 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 which 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.

Requirements

template<class Dt, class OutputIterator, class Pred>
OutputIterator	range_search ( Dt& delau, Dt::Point a, Dt::Point b, Dt::Point c, 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). Precondition: $$a is the upper left point, $$b the lower left, $$c the lower right and $$d the upper right point of the iso rectangle. 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 which 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.

Requirements