diff options
| author | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2019-06-12 07:46:27 +0200 |
|---|---|---|
| committer | ROUVREAU Vincent <vincent.rouvreau@inria.fr> | 2019-06-12 07:46:27 +0200 |
| commit | 6c57ce009e242db0554aaf9316750dd0bb693d6a (patch) | |
| tree | 94409a8ae609c48a6212ff61a90f7c083e0d8fcf /src/Bottleneck_distance/include/gudhi/Neighbors_finder.h | |
| parent | 4e33acbac51c8c2348dc88a16eb38e14c8ef724a (diff) | |
| parent | f58f0bb2cb99076d0cd3a11ad39f3277213e3f5e (diff) | |
Merge branch 'master' into main_documentation_pages
Diffstat (limited to 'src/Bottleneck_distance/include/gudhi/Neighbors_finder.h')
| -rw-r--r-- | src/Bottleneck_distance/include/gudhi/Neighbors_finder.h | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h b/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h index 36a63ea0..8c12d353 100644 --- a/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h +++ b/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h @@ -33,6 +33,7 @@ #include <unordered_set> #include <vector> #include <algorithm> // for std::max +#include <cmath> // for std::abs namespace Gudhi { @@ -45,7 +46,7 @@ struct Square_query { typedef Internal_point Point_d; typedef double FT; bool contains(Point_d p) const { - return std::max(std::abs(p.x()-c.x()), std::abs(p.y()-c.y())) <= size; + return (std::max)(std::abs(p.x()-c.x()), std::abs(p.y()-c.y())) <= size; } bool inner_range_intersects(CGAL::Kd_tree_rectangle<FT, D> const&r) const { return |