Efficient Hausdorff Distance computation for freeform geometric models in close proximity

We present an interactive-speed algorithm for computing the Hausdorff Distance (HD) between two freeform geometric models represented with NURBS surfaces. The algorithm is based on an effective technique for matching a surface patch from one model to the corresponding nearby surface patch on the other model. To facilitate the matching procedure, we employ a bounding volume hierarchy (BVH) for freeform NURBS surfaces, which provides a hierarchy of Coons patches and bilinear surfaces approximating the NURBS surfaces (Kim et al., 2011 [1]). Comparing the local HD upper bound against a global HD lower bound, we can eliminate the majority of redundant surface patches from further consideration. The resulting algorithm and the associated data structures are considerably simpler than the previous BVH-based HD algorithms. As a result, we can compute the HD of two freeform geometric models efficiently and robustly even when the two models are in close proximity. We demonstrate the effectiveness of our approach using several experimental results.

[1]  Helmut Alt,et al.  Computing the Hausdorff Distance between Curved Objects , 2008, Int. J. Comput. Geom. Appl..

[2]  H. Alt.  Discrete Geometric Shapes Matching Interpolation and Approximation A Survey , 2009 .

[3]  Iddo Hanniel,et al.  GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces , 2011, Comput. Aided Des..

[4]  김영준,et al.  Interactive Hausdorff Distance Computation for General Pohygonal Models , 2009, SIGGRAPH 2009.

[5]  Weiyin Ma,et al.  Computing the Hausdorff distance between two B-spline curves , 2010, Comput. Aided Des..

[6]  Gershon Elber,et al.  Precise Hausdorff distance computation between polygonal meshes , 2010, Comput. Aided Geom. Des..

[7]  Touradj Ebrahimi,et al.  MESH: measuring errors between surfaces using the Hausdorff distance , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[8]  Robert P. Markot,et al.  Surface algorithms using bounds on derivatives , 1986, Comput. Aided Geom. Des..

[9]  Leonidas J. Guibas,et al.  Discrete Geometric Shapes: Matching, Interpolation, and Approximation , 2000, Handbook of Computational Geometry.

[10]  Yu Meng,et al.  Polyline approach for approximating Hausdorff distance between planar free-form curves , 2011, Comput. Aided Des..

[11]  Gershon Elber,et al.  Hausdorff and Minimal Distances between Parametric Freeforms in R2 and R3 , 2008, GMP.

[12]  Mikhail J. Atallah,et al.  A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons , 1983, Inf. Process. Lett..

[13]  Gershon Elber,et al.  Coons BVH for freeform geometric models , 2011, SA '11.

[14]  William Rucklidge,et al.  Efficient Visual Recognition Using the Hausdorff Distance , 1996, Lecture Notes in Computer Science.

[15]  Dinesh Manocha,et al.  Accurate Minkowski sum approximation of polyhedral models , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[16]  Iddo Hanniel,et al.  Computing the Hausdorff distance between NURBS surfaces using numerical iteration on the GPU , 2012, Graph. Model..

[17]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[18]  Gershon Elber,et al.  Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer , 2010, The Visual Computer.

[19]  Bert Jüttler.  Bounding the Hausdorff distance between implicitly defined and/or parametric curves , 2001 .