Laurent Saboret 91f0bbfe23 Optimization: ...

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).

2008-07-08 14:45:38 +00:00

..

CGAL

Optimization:

2008-07-08 14:45:38 +00:00