dc.contributor.author | Straub, Raphael | en_US |
dc.contributor.editor | Paolo Cignoni and Jiri Sochor | en_US |
dc.date.accessioned | 2015-07-14T12:23:01Z | |
dc.date.available | 2015-07-14T12:23:01Z | |
dc.date.issued | 2007 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/egs.20071023 | en_US |
dc.description.abstract | We present an algorithm that computes the exact Hausdorff distance between two arbitrary triangular meshes. Our method computes squared distances for each point on each triangle of one mesh to all relevant triangles of the other mesh yielding a continuous, piecewise convex quadratic polynomial over domains bounded by conics. The maximum of this polynomial is the one-sided Hausdorff distance from one to the other mesh. We ensure the efficiency of our approach by employing a voxel grid for searching relevant triangles and an attributed half-edge data structure for representing the squared distance function. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Exact Computation of the Hausdorff Distance between Triangular Meshes | en_US |
dc.description.seriesinformation | EG Short Papers | en_US |
dc.description.sectionheaders | SP1 - Session 1 | en_US |
dc.identifier.doi | 10.2312/egs.20071023 | en_US |
dc.identifier.pages | 17-20 | en_US |