songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

do an initial try with the closest point since do_intersect is with a sphere and not a ball

This commit is contained in:
Sébastien Loriot 2019-09-30 18:18:06 +02:00 committed by Maxime Gimeno
parent a17c5b1eb2
commit fd43d44fa5
1 changed files with 15 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
View File

@ -53,10 +53,24 @@ public:
typedef typename Profile::Point Point;
typedef typename CGAL::Kernel_traits< Point >::Kernel Kernel;
if(op){
CGAL_assertion(!tree.empty());
const Point* p = boost::get<Point>(&op);
tree.accelerate_distance_queries();
Point cp = tree.best_hint(*p).first; // requires accelerate distance query to be called.
// We could do better by having access to the internal kd-tree
// and call search_any_point with a fuzzy_sphere.
if(tree.do_intersect(CGAL::Sphere_3<Kernel>(*p, threshold_dist*threshold_dist))){
const double sqtd = threshold_dist*threshold_dist;
// if no input vertex is closer than the threshold, then
// any face closer than the threshold is intersected by
// the sphere (avoid the inclusion of the mesh into the threshold sphere)
if( CGAL::compare_squared_distance(*p,cp, sqtd)!=LARGER ||
tree.do_intersect(CGAL::Sphere_3<Kernel>(*p, sqtd)))
{
return op;
}
return boost::none;