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
..
2006-02-16 14:30:13 +00:00
2007-03-17 09:21:06 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2007-02-15 21:24:48 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2006-07-31 22:33:02 +00:00
2006-02-16 14:30:13 +00:00
2007-10-20 20:51:59 +00:00
2007-03-21 17:11:17 +00:00
2007-02-15 21:24:48 +00:00
2008-07-08 14:45:38 +00:00
2006-02-16 14:30:13 +00:00
2007-03-07 19:34:29 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2006-02-16 14:30:13 +00:00
2007-03-08 10:05:31 +00:00