mirror of https://github.com/CGAL/cgal
93b2b7cbac
Use the bounded_priority_queue inside Orthogonal_k_neighbor search and K_neighbor_search, a maximum of code is now shared by these two classes. This reduces computation time and memory needed. Extend the interface: to save time the sequence k-nearest neighbors can be sorted (default) or not. Add a new test that ensures all methods find the same kth closest neighbor. Update manual. |
||
|---|---|---|
| .. | ||
| Building_kd_tree_with_ddim_points.cpp | ||
| Building_kd_tree_with_own_pointtype.cpp | ||
| Circular_query.cpp | ||
| Compare_methods.cpp | ||
| Distance.h | ||
| Iso_rectangle_2_query.cpp | ||
| K_neighbor_search_manhattan_distance_isobox_point.cpp | ||
| K_neighbor_search_with_circle.cpp | ||
| Orthogonal_incremental_neighbor_search.cpp | ||
| Orthogonal_k_neighbor_search.cpp | ||
| Point.h | ||
| Range_searching.cpp | ||
| Splitters.cpp | ||