 Mael Rouxel-Labbé
|
40d1550d65
|
'if' into 'else if' since min_coord(i) <= max_coord(i)
|
2018-04-19 15:59:21 +02:00 |
|
|
Mael Rouxel-Labbé
|
6897cdea85
|
Do not use an inner approx if 'eps > r'
|
2018-04-19 14:16:12 +02:00 |
|
|
Mael Rouxel-Labbé
|
15d925710e
|
Readability changes
|
2018-04-19 14:15:56 +02:00 |
|
|
Mael Rouxel-Labbé
|
7b510962f0
|
Use CGAL::square
|
2018-04-19 14:14:43 +02:00 |
|
|
Mael Rouxel-Labbé
|
65be29442b
|
Reworked Fuzzy_sphere
Same as a6f52ffc31
- Also fixed the way eps > r is handled
- Cached the inner and outer squared radius instead of recomputing every time
|
2018-03-23 17:06:08 +01:00 |
|
|
Mael Rouxel-Labbé
|
a6f52ffc31
|
Reworked Fuzzy_iso_box
- points on the boundary of the inner approximation are always reported
- points on the boundary of the outer approximation may or may not be reported
|
2018-03-23 17:03:17 +01:00 |
|
|
Sébastien Loriot
|
483f69728e
|
Refresh branch
|
2018-02-12 22:21:38 +01:00 |
|
|
Simon Giraudot
|
6269309d86
|
Use CGAL include for boost counting/transform iterators everywhere
|
2018-01-23 11:09:52 +01:00 |
|
|
Andreas Fabri
|
f76e744bff
|
Spatial_searching
|
2018-01-17 20:12:06 +00:00 |
|
|
Andreas Fabri
|
fb51a69c7c
|
Mesh_2
|
2018-01-17 16:50:21 +00:00 |
|
|
Marc Glisse
|
e2bb2b383b
|
Merge branch 'master' into Faster_dd_spatial_searching-cjamin
|
2017-12-07 15:26:46 +01:00 |
|
|
Clement Jamin
|
5806c25460
|
Specify 4th template argument for Kd_tree
|
2017-11-24 15:35:14 +01:00 |
|
|
Clement Jamin
|
3b6364b5cc
|
Merge branch 'Faster_dd_spatial_searching-cjamin' of github.com:cjamin/cgal into Faster_dd_spatial_searching-cjamin
|
2017-11-22 11:32:12 +01:00 |
|
|
Clement Jamin
|
06b18208e8
|
Specify 4th template argument for Kd_tree + doc
|
2017-11-22 11:31:58 +01:00 |
|
|
Sébastien Loriot
|
04aa045706
|
add missing identifiers
|
2017-11-21 13:41:58 +01:00 |
|
|
Marc Glisse
|
076c3b6ac1
|
Only check the result if we have computed a result.
|
2017-11-21 00:02:44 +01:00 |
|
|
Marc Glisse
|
2df3c40fd7
|
Don't test outer_range_contains in search_any_point.
That just slows it down. The test makes much more sense in search(),
which reports all points.
|
2017-11-20 23:13:47 +01:00 |
|
|
Clement Jamin
|
7d69e65cef
|
Fix indentation
|
2017-11-20 10:56:47 +01:00 |
|
|
Clement Jamin
|
be5870e269
|
Clean-up debug code
|
2017-11-20 10:55:19 +01:00 |
|
|
Clement Jamin
|
8d71d73dc8
|
Merge remote-tracking branch 'remotes/cgal/master' into Faster_dd_spatial_searching-cjamin
|
2017-11-17 10:41:54 +01:00 |
|
|
Clement Jamin
|
005f770ef6
|
Missing typename
|
2017-11-16 19:01:56 +01:00 |
|
|
Clement Jamin
|
7954d37086
|
Useless typename
|
2017-11-16 18:57:20 +01:00 |
|
|
Clement Jamin
|
319d2d614c
|
Fix compilation continued
|
2017-11-16 18:48:00 +01:00 |
|
|
Clement Jamin
|
bc5a5c2265
|
Fix code so that it compiles on Linux
|
2017-11-16 16:46:05 +01:00 |
|
|
Clement Jamin
|
63af2a0b73
|
Fix: inappropriate typename
|
2017-11-14 11:02:48 +01:00 |
|
|
Sébastien Loriot
|
ee57fc2d6c
|
add SPDX identifier for files under the GPL-3+ license
|
2017-11-12 10:17:51 +01:00 |
|
|
Sébastien Loriot
|
b352c90b11
|
add missing include directive for license checking
|
2017-10-20 22:34:07 +02:00 |
|
|
Clement Jamin
|
e61e724312
|
Missing include + fix initialization order
|
2017-10-18 15:44:07 +02:00 |
|
|
Clement Jamin
|
1978b63fd9
|
Optimize (cache+interruptible) non-orthogonal nearest/furthest neighbor search
|
2017-10-18 15:43:22 +02:00 |
|
|
Clement Jamin
|
9e2a551ad7
|
Use cache (if available) in search_any_point
|
2017-10-18 11:04:00 +02:00 |
|
|
Clement Jamin
|
ae1f89b4d3
|
Optimize "search" (all points in ball) when using cache
|
2017-10-11 10:23:31 +02:00 |
|
|
Laurent Rineau
|
7e9f756935
|
Replace all std::unary_function by CGAL::unary_function
|
2017-10-04 15:57:09 +02:00 |
|
|
Clement Jamin
|
f0a89af33b
|
Merge branch 'Faster_dd_spatial_searching-cjamin-old' into Faster_dd_spatial_searching-cjamin
|
2017-09-15 11:11:28 +02:00 |
|
|
Clement Jamin
|
1f11dfa004
|
Use cache when computing furthest neighbors (incremental seach)
|
2017-09-08 18:34:36 +02:00 |
|
|
Clement Jamin
|
2f305ec10f
|
Use cache when computing furthest neighbors
|
2017-09-08 17:37:09 +02:00 |
|
|
Clement Jamin
|
82b1ebb063
|
Clean-up code
|
2017-06-27 17:59:21 +02:00 |
|
|
Clement Jamin
|
0de1362e09
|
Use cache if available for NEAREST neighbor search
|
2017-06-21 00:34:02 +02:00 |
|
|
Clement Jamin
|
1cfab77634
|
Rename header file
|
2017-06-20 19:52:09 +02:00 |
|
|
Clement Jamin
|
17a683484f
|
Move some code to Distance_helper.h + copyright + bug fix
|
2017-06-20 19:47:26 +02:00 |
|
|
Clement Jamin
|
b5e948be92
|
FT is supposed to be public
|
2017-06-20 19:46:40 +02:00 |
|
|
Clement Jamin
|
d1659e0315
|
More minor code improvements
|
2017-06-20 15:13:02 +02:00 |
|
|
Clement Jamin
|
4cabf30131
|
Shorten typedefs
|
2017-06-20 15:09:55 +02:00 |
|
|
Clement Jamin
|
33e188dac1
|
Fix bad merge
|
2017-06-19 16:46:23 +02:00 |
|
|
Clement Jamin
|
5b9562ea84
|
Merge branch 'Triangulation-add_regular_tri-cjamin_mglisse-old' into Triangulation-add_regular_tri-cjamin_mglisse
|
2017-06-16 11:09:07 +02:00 |
|
|
Clement Jamin
|
a801221193
|
Remove the use of numeric_limits + fix typo + better interruptible version
|
2017-06-13 17:07:20 +02:00 |
|
|
Clement Jamin
|
069ab04c7e
|
Add comment
|
2017-05-22 16:42:07 +02:00 |
|
|
Clement Jamin
|
5e662a03db
|
Fix the way we detect the cache
|
2017-05-22 16:23:58 +02:00 |
|
|
Marc Glisse
|
54f2b91d6c
|
Fix printing of empty Kd_tree.
|
2017-05-22 11:51:52 +02:00 |
|
|
Clement Jamin
|
e9c35e3861
|
Allow to enable/disable cache of points
|
2017-05-19 16:06:02 +02:00 |
|
|
Clement Jamin
|
26ee6b1a10
|
Auto-detect if the distance functor has some member functions:
transformed_distance_from_coordinates
interruptable_transformed_distance
|
2017-05-09 17:01:05 +02:00 |
|