mirror of https://github.com/CGAL/cgal
Store the neighbors found in a std::set, instead of a list sorted by insertion sort (in type NN_list). This makes insertion O(log n) instead of O(n). |
||
|---|---|---|
| .. | ||
| benchmark/Spatial_searching | ||
| demo/Spatial_searching | ||
| doc_tex | ||
| examples/Spatial_searching | ||
| include/CGAL | ||
| package_info/Spatial_searching | ||
| test/Spatial_searching | ||
| dont_submit | ||