MeshSweeper: From Closest Point to Hausdorff Distance Between Meshes

Loading...
Thumbnail Image
Date
2000
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics Association
Abstract
We introduce a new algorithm for computing the distance from a point to an arbitrary polygonal mesh. Our algorithm uses a multi-resolution hierarchy of bounding volumes generated by geometric simplification. Our algorithm is dynamic, exploiting coherence between subsequent queries using a priority process (without caching the closest point), and achieving constant time queries in some cases. The method also applies to a mesh that deforms nonrigidly. Achieving from about 500 to several thousand queries per second for a complex polygonal shape on a PC, our method has applications both for interactive and photo-realistic graphics. In particular, we study in this paper the application to computing the Hausdorff distance between two polygonal shapes, with an arbitrary precision.
Description

        
@inproceedings{
:10.2312/egs.20001020
, booktitle = {
Eurographics 2000 - Short Presentations
}, editor = {}, title = {{
MeshSweeper: From Closest Point to Hausdorff Distance Between Meshes
}}, author = {
Gueziec, A.
}, year = {
2000
}, publisher = {
Eurographics Association
}, ISSN = {
1017-4656
}, ISBN = {}, DOI = {
/10.2312/egs.20001020
} }
Citation