Title: Fast and accurate Hausdorff distance calculation between meshes
Authors: Guthe, Michael
Borodin, Pavel
Klein, Reinhard
Citation: Journal of WSCG. 2005, vol. 13, no. 2, p. 41-48.
Issue Date: 2005
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://wscg.zcu.cz/WSCG2005/Papers_2005/Journal/!WSCG2005_Journal_Final.pdf
ISSN: 1213–6964 (online)
1213–6980 (CD-ROM)
1213–6972 (hardcover)
Keywords: polygonální mřížky;výpočet vzdálenosti;Hausdorffova vzdálenost
Keywords in different language: polygonal meshes;distance calculation;Hausdorff distance
Abstract: Complex models generated e.g. with a laser range scanner often consist of several thousand or million triangles. For efficient rendering this high number of primitives has to be reduced. An important property of mesh reduction – or simplification – algorithms used for rendering is the control over the introduced geometric error. In general, the better this control is, the slower the simplification algorithm becomes. This is especially a problem for out-of-core simplification, since the processing time quickly reaches several hours for high-quality simplification. In this paper we present a new efficient algorithm to measure the Hausdorff distance between two meshes by sampling the meshes only in regions of high distance. In addition to comparing two arbitrary meshes, this algorithm can also be applied to check the Hausdorff error between the simplified and original meshes during simplification. By using this information to accept or reject a simplification operation, this method allows fast simplification while guaranteeing a user-specified geometric error.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 13, Number 1-3 (2005)

Files in This Item:
File Description SizeFormat 
Guthe.pdfPlný text334,29 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/1446

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