#include <CGAL/Arr_batched_point_location.h>
| ||||
|
| |||
Performs a batched point-location operation on an arrangement.
The function accepts a range of query points, defined by
[points_begin, points_end) and locates each point in the
arrangement. The query-results are returned in through the output iterator,
whose value type is std::pair<Point_2,Object>. Namely, each
result is given as a point and an object represneting the arrangement
feature that contains it (an Object that may be either
Face_const_handle, Halfedge_const_handle or
Vertex_const_hanlde). The result pair in output sequence are sorted
by an increasing -lexicographical order on the query points.
The function returns a past-the-end iterator for the output sequence. Precondition: The value-type of PointsIterator is Traits::Point_2. Precondition: The value-type of OutputIterator is std::pair<Traits::Point_2,Object>. |