Show simple item record

dc.contributor.authorStraub, Raphaelen_US
dc.contributor.editorPaolo Cignoni and Jiri Sochoren_US
dc.date.accessioned2015-07-14T12:23:01Z
dc.date.available2015-07-14T12:23:01Z
dc.date.issued2007en_US
dc.identifier.urihttp://dx.doi.org/10.2312/egs.20071023en_US
dc.description.abstractWe 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.publisherThe Eurographics Associationen_US
dc.titleExact Computation of the Hausdorff Distance between Triangular Meshesen_US
dc.description.seriesinformationEG Short Papersen_US
dc.description.sectionheadersSP1 - Session 1en_US
dc.identifier.doi10.2312/egs.20071023en_US
dc.identifier.pages17-20en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record