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
06dd4a4522
Add a geom-traits concept for distance functions
...
Update the code and the doc accordingly
2016-12-29 07:20:23 +01: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
eb6146e0dc
no need for passing the vector dists through the recursive function
2015-01-07 17:44:58 +01:00
61f642bde6
Changed order of nodes in deque
...
Fixed example with user defined point.
Fixed weighted minkowski distance.
2014-12-16 11:49:15 +01:00
ffca6da15d
Fix compilation on Linux
2014-12-15 13:41:49 +01:00
53aecd416f
Deleted double indirection
2014-12-08 12:10:52 +01:00
395b6a6d80
Test worst dist again
2014-12-05 16:17:17 +01:00
6c548a9fad
Removed worst dist check
2014-12-05 09:12:05 +01:00
e893bc94d3
Check worst dist before make_pair
2014-12-04 11:46:10 +01:00
8258187d47
Fix compilation error: missing "typename"
2014-12-03 16:20:22 +01:00
b08583e319
Specialized compute_neighbors_orthogonally
...
It's now compute_nearest_neighbor_orthogonally and
compute_furthest_neighbor_orthogonally
2014-12-03 10:47:52 +01:00
af343d926e
Added new traversal rule and dists vector to Orthogonal search
...
Functions min_dist_to_rectangle and max... have an overload with
std::vector<FT>& dists now. That is required for ortho searches, so
we have no backwards compatibility.
The values for extended internal nodes have also been changed.
2014-12-02 10:36:36 +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
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
9bb873a0cf
remove unused variable in Base constructor
2010-08-19 12:24:38 +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
13152be1ea
Fixed call to base's 'branch' function
2010-03-25 14:36:39 +00:00
baee18c295
forget to save two files
2010-01-29 15:21:23 +00:00
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
ef48e6975a
unsigned K parameter in orthogonal search
2008-07-27 16:46:13 +00:00
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
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
Sébastien Loriot
Maxime Gimeno
Andreas Fabri
m.overtheil
Laurent Rineau
Laurent Rineau
Sébastien Loriot
Fernando Cacciola
Ophir Setter
Laurent Saboret
Sylvain Pion