From a666140907ef3dc72babd4e0968534c7b9265ce0 Mon Sep 17 00:00:00 2001 From: glisse Date: Thu, 30 Nov 2017 15:36:30 +0000 Subject: Small optimization for neighbor search in bottleneck. git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/misc-glisse@2989 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 5f13ee7292f8c43a430ee80d27e549ad0d1e938b --- src/Bottleneck_distance/include/gudhi/Neighbors_finder.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/Bottleneck_distance') diff --git a/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h b/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h index a6b9b021..dc804630 100644 --- a/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h +++ b/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h @@ -44,7 +44,7 @@ struct Square_query { typedef Internal_point Point_d; typedef double FT; bool contains(Point_d p) const { - return std::abs(p.x()-c.x()) <= size && 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 const&r) const { return -- cgit v1.2.3