mirror of https://github.com/CGAL/cgal
Do not add triangles that cannot realize the distance to the priority queue
This commit is contained in:
parent
bd29b976f5
commit
f46d4d1fae
|
|
@ -1712,8 +1712,9 @@ bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm1,
|
||||||
// which can go down, so it is only recomputed once splitting is finished,
|
// which can go down, so it is only recomputed once splitting is finished,
|
||||||
// using the top value of the PQ
|
// using the top value of the PQ
|
||||||
|
|
||||||
// Add the subtriangle to the candidate list.
|
// Add the subtriangle to the candidate list if it is meaningful
|
||||||
candidate_triangles.emplace(sub_triangles[i], sub_triangle_bounds, triangle_and_bounds.tm1_face);
|
if(sub_triangle_bounds.upper >= global_bounds.lower)
|
||||||
|
candidate_triangles.emplace(sub_triangles[i], sub_triangle_bounds, triangle_and_bounds.tm1_face);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Update global upper Hausdorff bound after subdivision.
|
// Update global upper Hausdorff bound after subdivision.
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue