SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Collision Detection and Response for Computer Animation
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Fast penetration depth computation for physically-based animation
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Face Detection Using the Hausdorff Distance
AVBPA '01 Proceedings of the Third International Conference on Audio- and Video-Based Biometric Person Authentication
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Nonconvex rigid bodies with stacking
ACM SIGGRAPH 2003 Papers
Accurate Minkowski Sum Approximation of Polyhedral Models
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering
Computational Optimization and Applications
Ray tracing deformable scenes using dynamic bounding volume hierarchies
ACM Transactions on Graphics (TOG)
Generalized penetration depth computation
Computer-Aided Design
Classroom examples of robustness problems in geometric computations
Computational Geometry: Theory and Applications
Hausdorff approximation of 3D convex polytopes
Information Processing Letters
Precise Hausdorff distance computation between polygonal meshes
Computer Aided Geometric Design
Recent advances in real-time collision and proximity computations for games and simulations
ACM SIGGRAPH ASIA 2010 Courses
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Polyline approach for approximating Hausdorff distance between planar free-form curves
Computer-Aided Design
GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces
Computer-Aided Design
PolyDepth: Real-time penetration depth computation using iterative contact-space projection
ACM Transactions on Graphics (TOG)
Similarity search on a large collection of point sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient point-projection to freeform curves and surfaces
Computer Aided Geometric Design
Automatic single-view character model reconstruction
Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling
ACM Transactions on Graphics (TOG)
Computer-Aided Design
| Hi-index | 0.00 |
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.