From a4112c4c8b32a17a1b05e3fe07ca60243ebb3efe Mon Sep 17 00:00:00 2001 From: Martin Skrodzki Date: Tue, 18 Jun 2019 07:01:06 +0200 Subject: [PATCH] Implement calling of TM2_tree traversal. --- ..._traversal_traits_with_Hausdorff_distance.h | 18 +++++++++++------- 1 file changed, 11 insertions(+), 7 deletions(-) diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_Hausdorff_distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_Hausdorff_distance.h index 7684159ba4c..c77a3a227cf 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_Hausdorff_distance.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_Hausdorff_distance.h @@ -139,14 +139,18 @@ namespace CGAL { // Have reached a single triangle std::cout << "Reached Triangle in TM1: " << primitive.id() << '\n'; + // Call Culling on B with the single triangle found. + Hausdorff_primitive_traits_tm2 traversal_traits_tm2( tm2_tree.traits() ); + tm2_tree.traversal(primitive, traversal_traits_tm2); - Hausdorff_primitive_traits_tm2 traversal_traits_tm2( tm2_tree.traits() ); - /* TODO implement handling of a single triangle - / - Call Culling on B (First maybe don't cull, but only consider closest - / triangle), obtain local bounds for the triangle - / - Update global Hausdorff bounds according to the obtained local bounds - / - return the current best known global bounds - */ + // Update global Hausdorff bounds according to the obtained local bounds + Hausdorff_bounds local_bounds = traversal_traits_tm2.get_local_bounds(); + if (local_bounds.first > h_lower) { + h_lower = local_bounds.first; + } + if (local_bounds.second > h_upper) { + h_upper = local_bounds.second; + } } // Determine whether child nodes will still contribute to a larger