8 Commits

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
Andreas Fabri	193066c8bf	Add 'using' for strict ANSI compliance	2010-05-05 15:48:50 +00:00
Sébastien Loriot	baee18c295	forget to save two files	2010-01-29 15:21:23 +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
Ophir Setter	ef48e6975a	unsigned K parameter in orthogonal search	2008-07-27 16:46:13 +00:00
Laurent Saboret	db6a8f948c	Change CVS keywords to SVN style	2006-02-16 14:30:13 +00:00
Laurent Saboret	1aad55d4cb	Change CVS keywords to SVN style	2006-02-14 10:08:15 +00:00
Laurent Saboret	091f0804c0	Move packages to trunk root	2006-02-14 08:58:19 +00:00