GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces

被引:21
作者
Krishnamurthy, Adarsh [1 ]
McMains, Sara [1 ]
Hanniel, Iddo [2 ]
机构
[1] Univ Calif Berkeley, Berkeley, CA 94720 USA
[2] Technion Israel Inst Technol, Haifa, Israel
基金
美国国家科学基金会;
关键词
Hausdorff distance; NURBS; GPU; Geometric algorithms;
D O I
10.1016/j.cad.2011.08.022
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a parallel GPU-accelerated algorithm for computing the directed Hausdorff distance from one NURBS surface to another, within a bound. We make use of axis-aligned bounding-box hierarchies that bound the NURBS surfaces to accelerate the computations. We dynamically construct as well as traverse the bounding-box hierarchies for the NURBS surfaces using operations that are optimized for the CPU. To compute the Hausdorff distance, we traverse this hierarchy after culling bounding-box pairs that do not contribute to the Hausdorff distance. Our contribution includes two-sided culling tests that can be performed in parallel using the GPU. The culling, based on the minimum and maximum distance ranges between the bounding boxes, eliminates bounding-box pairs from both surfaces that do not contribute to the Hausdorff distance simultaneously. We calculate accuracy bounds for our computed Hausdorff distance based on the curvature of the surfaces. Our algorithm runs in real-time with very small guaranteed error bounds for complex NURBS surfaces. Since we dynamically construct our bounding-box hierarchy, our algorithm can be used to interactively compute the Hausdorff distance for models made of dynamic deformable surfaces. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1370 / 1379
页数:10
相关论文
共 22 条
  • [1] APPROXIMATE MATCHING OF POLYGONAL SHAPES
    ALT, H
    BEHRENDS, B
    BLOMER, J
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 13 (3-4) : 251 - 265
  • [2] Alt H, 2003, ALGORITHM COMBINAT, V25, P65
  • [3] Alt H., 2004, 20 EUROPEAN WORKSHOP, P233
  • [4] Computing the Hausdorff distance between curved objects
    Alt, Helmut
    Scharf, Ludmila
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2008, 18 (04) : 307 - 320
  • [5] A LINEAR TIME ALGORITHM FOR THE HAUSDORFF DISTANCE BETWEEN CONVEX POLYGONS
    ATALLAH, MJ
    [J]. INFORMATION PROCESSING LETTERS, 1983, 17 (04) : 207 - 209
  • [6] Polyline approach for approximating Hausdorff distance between planar free-form curves
    Bai, Yan-Bing
    Yong, Jun-Hai
    Liu, Chang-Yuan
    Liu, Xiao-Ming
    Meng, Yu
    [J]. COMPUTER-AIDED DESIGN, 2011, 43 (06) : 687 - 698
  • [7] Precise Hausdorff distance computation between polygonal meshes
    Barton, Michael
    Hanniel, Iddo
    Elber, Gershon
    Kim, Myung-Soo
    [J]. COMPUTER AIDED GEOMETRIC DESIGN, 2010, 27 (08) : 580 - 591
  • [8] Computing the Hausdorff distance between two B-spline curves
    Chen, Xiao-Diao
    Ma, Weiyin
    Xu, Gang
    Paul, Jean-Claude
    [J]. COMPUTER-AIDED DESIGN, 2010, 42 (12) : 1197 - 1206
  • [9] Elberl G, 2008, LECT NOTES COMPUT SC, V4975, P191
  • [10] Filip D., 1986, Computer-Aided Geometric Design, V3, P295, DOI 10.1016/0167-8396(86)90005-1