songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
48,105 Commits 3 Branches 156 Tags 962 MiB
Commit Graph

15 Commits

Author SHA1 Message Date
Laurent Rineau 8f59fd9592 Turn QPL into LGPLv3+ 2012-01-13 16:33:35 +00:00
Sébastien Loriot 37b02012b6 fix const-correctness issue in the spatial searching package. In particular this 
remove all mutable member variable and leave only one const_cast in the kd-kdtree private function
const_build. This function is called in const predicates when the tree is not already internally built.
The documentation has been update and a few typos fixed at the same time.
 2011-09-07 09:04:52 +00:00
Laurent Rineau 369498d1e5 Cancel revision 64607. There had been a problem with the branch. 
| ------------------------------------------------------------------------
  | r64607 | efif | 2011-07-05 17:27:04 +0200 (Tue, 05 Jul 2011) | 1 line
  | 
  | Merged feature-branch Aos_2-new_functors-tau into next
  | ------------------------------------------------------------------------
 2011-07-06 11:11:58 +00:00
Sébastien Loriot 9bb873a0cf remove unused variable in Base constructor 2010-08-19 12:24:38 +00:00
Andreas Fabri 803a2dbc0e cleanup 2010-05-21 13:27:10 +00:00
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
Fernando Cacciola 13152be1ea Fixed call to base's 'branch' function 2010-03-25 14:36:39 +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 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
Sylvain Pion 884c477f20 macros must be prefixed by CGAL_ 2007-02-15 21:24:48 +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