songsenand/cgal - cgal

Commit Graph

Author	SHA1	Message	Date
Sébastien Loriot	51eac5d5ab	add comments	2010-02-25 13:49:04 +00:00
Sébastien Loriot	1382b9552d	Add non-documented interface for APSS reconstruction. Remove no longer needed Fast_orthogonal_k_neighbor_search (changes integrated in Orthogonal_k_neighbor_search)	2010-02-23 16:01:49 +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

51eac5d5ab

add comments

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

Sébastien Loriot

1382b9552d

Add non-documented interface for APSS reconstruction.

Remove no longer needed Fast_orthogonal_k_neighbor_search (changes integrated in Orthogonal_k_neighbor_search)

2010-02-23 16:01:49 +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