mirror of https://github.com/CGAL/cgal
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 |
||
|---|---|---|
| .. | ||
| benchmark/Spatial_searching | ||
| demo/Spatial_searching | ||
| doc_tex | ||
| examples/Spatial_searching | ||
| include/CGAL | ||
| package_info/Spatial_searching | ||
| test/Spatial_searching | ||
| dont_submit | ||