f76e744bff
Spatial_searching
2018-01-17 20:12:06 +00:00
ee57fc2d6c
add SPDX identifier for files under the GPL-3+ license
2017-11-12 10:17:51 +01:00
50510c05ea
add include directive for license of all GPL header files
...
done using:
ack-grep "^GPL" */package_info/*/license.txt -l | awk -F "/" '{print $1}' > /tmp/gpl_packages
for i in `cat /tmp/gpl_packages | \
grep -v Operations_on_polyhedra | \
grep -v Algebraic_kernel_for_circles | \
grep -v Algebraic_kernel_for_spheres | \
grep -v Polyhedron_IO`;
do
echo $i
python Scripts/developer_scripts/add_license_in_pkg_header.py $i
done
python Scripts/developer_scripts/add_license_in_pkg_header.py Operations_on_polyhedra Polygon_mesh_processing
python Scripts/developer_scripts/add_license_in_pkg_header.py Algebraic_kernel_for_circles Circular_kernel_2
python Scripts/developer_scripts/add_license_in_pkg_header.py Algebraic_kernel_for_spheres Circular_kernel_3
python Scripts/developer_scripts/add_license_in_pkg_header.py Polyhedron_IO Polyhedron
2017-01-19 15:20:25 +01:00
6ec27d359e
fix furthest orthogonal incremental neighbor
...
previously the current distance was always larger than the initial
one. As a result no branch of the tree could be filtered out and
all the nodes were visited.
2016-06-06 14:41:33 +02:00
849c097cfd
A possible fix for further neighbor search
...
if we want to keep using tigh bbox we need more double per node
2016-06-03 16:40:13 +02:00
06704ceaee
fix a typo
2015-09-24 13:55:57 +02:00
a5dfe6743b
make (Orthogonal_)incremental_nearest_neighbor a valid range
2015-09-24 08:21:05 +02:00
cbaece6134
qualify get<0>(..)
2015-01-10 06:22:51 +01:00
5adf8e388c
Workaround for boost::container::deque; 1 bug fix
2015-01-09 10:23:32 +01:00
93e11cfeb4
Divided search in nearest and furthest
2014-12-09 15:35:16 +01:00
53aecd416f
Deleted double indirection
2014-12-08 12:10:52 +01:00
8258187d47
Fix compilation error: missing "typename"
2014-12-03 16:20:22 +01:00
9b3d496572
Added changes from Orthogonal search to Orthogonal inc search
2014-12-02 15:39:41 +01:00
cb4f9c3521
Divided Kd_tree_node into internal and leaf node
...
The Kd_tree_node now has two derived classes Kd_tree_internal_node
and Kd_tree_leaf_node. This commit is tested under Windows x64
2014-11-27 15:42:18 +01:00
8f59fd9592
Turn QPL into LGPLv3+
2012-01-13 16:33:35 +00:00
69b2f7079a
BUGFIX:
...
incremental neighbor search classes were storing a nested ref_counted iterator
for begin() which implies that a call to operator++ on a copy of an iterator
increment the internal copy of the class (cannot make several pass).
There is still a problem in case of copy outside of the class but this is
a first step (a deep_copy method should be provided for iterators which would
need a small feature).
2012-01-05 09:45:15 +00:00
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
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
5ee07db31f
operator= of iterator: do nothing when internal ptr are the same.
2010-10-22 13:17:52 +00:00
ece84b02fd
iterator of Incremental_nn: add missing const to operator* + types required by std algo
...
itertator of Ortho_incremental_nn: the iterator tag was incorrect: forward -> input
2010-10-22 10:58:59 +00:00
97ddcd58ac
add missing operator= which was responsible for a double delete
...
of a ref-counted value.
2010-10-21 14:28:31 +00:00
26e4e3ae68
correct bug in postfix++ of interator in incremental neighbor search methods
2010-08-18 12:53:25 +00:00
677fa29eb8
add operator-> in iterator of incremental neighbor search classes
2010-08-18 09:52:36 +00:00
803a2dbc0e
cleanup
2010-05-21 13:27:10 +00:00
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
41ba81d1a4
add const to the reference taken for the query point
2010-03-15 13:33:51 +00:00
884c477f20
macros must be prefixed by CGAL_
2007-02-15 21:24:48 +00:00
db6a8f948c
Change CVS keywords to SVN style
2006-02-16 14:30:13 +00:00
1aad55d4cb
Change CVS keywords to SVN style
2006-02-14 10:08:15 +00:00
091f0804c0
Move packages to trunk root
2006-02-14 08:58:19 +00:00
Andreas Fabri
Sébastien Loriot
m.overtheil
Laurent Rineau
Laurent Rineau
Sébastien Loriot
Sylvain Pion
Laurent Saboret