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

377 Commits

Author SHA1 Message Date
Andreas Fabri 058ded3975 int -> size_type/std::size_t 2010-06-21 16:22:00 +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
Andreas Fabri 193066c8bf Add 'using' for strict ANSI compliance 2010-05-05 15:48:50 +00:00
Fernando Cacciola 13152be1ea Fixed call to base's 'branch' function 2010-03-25 14:36:39 +00:00
Sébastien Loriot 41ba81d1a4 add const to the reference taken for the query point 2010-03-15 13:33:51 +00:00
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
Sylvain Pion 85dc12f2a7 Remove empty lines at beginning and end of files 
(apply Scripts/developer_scripts/remove_empty_lines.pl).
 2010-02-01 12:55:28 +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 ef264999b3 Renaming of Compact_container's construct_insert() to emplace() to match C++0x. 
It breaks backward compat, but I doubt many people use Compact_container directly.
Make it use variadic templates, while at it.
 2007-10-20 20:51:59 +00:00
Andreas Fabri 88d0413012 allow empty tree and fix search for empty tree 2007-05-02 08:28:37 +00:00
Andreas Fabri b10177c003 Removed unused parameter 2007-03-21 17:11:17 +00:00
Andreas Fabri fdbaee74b0 removed unused parameters 2007-03-17 09:21:06 +00:00
Sylvain Pion d82965e1eb warning-- 2007-03-08 10:05:31 +00:00
Fernando Cacciola 6e56e11e77 Fixed is_empty() bug that was causing "test/Splitters.exe" to assert 2007-03-07 19:34:29 +00:00
Sylvain Pion 884c477f20 macros must be prefixed by CGAL_ 2007-02-15 21:24:48 +00:00
Fernando Cacciola 721515e9c1 Fixed uninitialized iterators problem 2006-12-11 14:46:55 +00:00
Andreas Fabri e7ed3f05fd Fixed min max problem 2006-07-31 22:33:02 +00:00
Andreas Fabri 9d7a7e428a Fixed bug in constructor of Point_container (nonexisting conversion from int to std::vector::iterator) 2006-03-08 10:02:43 +00:00
Marc Glisse 3d1ee0cf13 Missing std:: 2006-02-26 00:25:19 +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