mirror of https://github.com/CGAL/cgal
961b9d8557
handle case when kdtree is empty for all 4 nearest neighbor search method correct sort method of bounded_priority_queue (was sorting the complete vector even if not full) ==> fix the crash when k > nb input points Modify test suite to handle these particular cases |
||
|---|---|---|
| .. | ||
| 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 | ||