songsenand/cgal - cgal

Commit Graph

Author	SHA1	Message	Date
Sébastien Loriot	961b9d8557	add empty() method to kdtree 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	2010-05-11 12:52:53 +00:00
Sébastien Loriot	51eac5d5ab	add comments	2010-02-25 13:49:04 +00:00
Sébastien Loriot	93b2b7cbac	Add bounded priority queue as an internal data-structure. Use the bounded_priority_queue inside Orthogonal_k_neighbor search and K_neighbor_search, a maximum of code is now shared by these two classes. This reduces computation time and memory needed. Extend the interface: to save time the sequence k-nearest neighbors can be sorted (default) or not. Add a new test that ensures all methods find the same kth closest neighbor. Update manual.	2010-01-29 15:19:39 +00:00

Author

SHA1

Message

Date

Sébastien Loriot

961b9d8557

add empty() method to kdtree

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

2010-05-11 12:52:53 +00:00

Sébastien Loriot

51eac5d5ab

add comments

2010-02-25 13:49:04 +00:00

Sébastien Loriot

93b2b7cbac

Add bounded priority queue as an internal data-structure.

Use the bounded_priority_queue inside Orthogonal_k_neighbor search
and K_neighbor_search, a maximum of code is now shared by these two classes.
This reduces computation time and memory needed.
Extend the interface: to save time the sequence  k-nearest neighbors 
can be sorted (default) or not. 
Add a new test that ensures all methods find the same kth closest neighbor.
Update manual.

2010-01-29 15:19:39 +00:00

3 Commits