|
CGAL 6.1.3 - 2D Arrangements
|
Classes | |
| class | CGAL::Arr_landmarks_point_location< Arrangement, Generator > |
| More... | |
| class | CGAL::Arr_naive_point_location< Arrangement > |
| More... | |
| struct | CGAL::Arr_point_location_result< Arrangement > |
| A unary metafunction to determine the return type of a point-location or vertical ray-shoot query. More... | |
| class | CGAL::Arr_trapezoid_ric_point_location< Arrangement > |
| More... | |
| class | CGAL::Arr_triangulation_point_location< Arrangement_ > |
| More... | |
| class | CGAL::Arr_walk_along_line_point_location< Arrangement > |
| More... | |
Functions | |
| template<typename Traits, typename Dcel, typename InputIterator, typename OutputIterator> | |
| OutputIterator | CGAL::locate (const Arrangement_2< Traits, Dcel > &arr, InputIterator begin, InputIterator end, OutputIterator oi) |
| performs a batched point-location operation on a given arrangement. | |
| OutputIterator CGAL::locate | ( | const Arrangement_2< Traits, Dcel > & | arr, |
| InputIterator | begin, | ||
| InputIterator | end, | ||
| OutputIterator | oi ) |
#include <CGAL/Arr_batched_point_location.h>
performs a batched point-location operation on a given arrangement.
It accepts a collection of query points, locates each point in a given arrangement, and inserts the query results into an output container given through an output iterator. Each query result is given as a pair of the query point and an object representing the arrangement feature that contains it, namely a discriminated union container of the types Face_const_handle, Halfedge_const_handle, and Vertex_const_hanlde. The resulting pairs in the output container are sorted in increasing \(xy\)-lexicographical order of the query points.
| arr | The arrangement. |
| begin | The begin iterator of the container of input points. |
| end | The past-the-end iterator of the container of input points. |
| oi | The output iterator that points at the output container. |
Requirements