View : 19 Download: 0

Interactive Hausdorff distance computation for general polygonal models

Title
Interactive Hausdorff distance computation for general polygonal models
Authors
Tang M.Lee M.Kim Y.J.
Ewha Authors
김영준
SCOPUS Author ID
김영준scopus
Issue Date
2009
Journal Title
ACM Transactions on Graphics
ISSN
0730-0301JCR Link
Citation
vol. 28, no. 3
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
We present a simple algorithm to compute the Hausdorff distance between complicated, polygonal models at interactive rates. The algorithm requires no assumptions about the underlying topology and geometry. To avoid the high computational and implementation complexity of exact Hausdorff distance calculation, we approximate the Hausdorff distance within a user-specified error bound. The main ingredient of our approximation algorithm is a novel polygon subdivision scheme, called Voronoi subdivision, combined with culling between the models based on bounding volume hierarchy (BVH). This cross-culling method relies on tight yet simple computation of bounds on the Hausdorff distance, and it discards unnecessary polygon pairs from each of the input models alternatively based on the distance bounds. This algorithm can approximate the Hausdorff distance between polygonal models consisting of tens of thousands triangles with a small error bound in real-time, and outperforms the existing algorithm by more than an order of magnitude. We apply our Hausdorff distance algorithm to the measurement of shape similarity, and the computation of penetration depth for physically-based animation. In particular, the penetration depth computation using Hausdorff distance runs at highly interactive rates for complicated dynamics scene. © 2009 ACM.
DOI
10.1145/1531326.1531380
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE