Název: Fast and accurate Hausdorff distance calculation between meshes
Autoři: Guthe, Michael
Borodin, Pavel
Klein, Reinhard
Citace zdrojového dokumentu: Journal of WSCG. 2005, vol. 13, no. 2, p. 41-48.
Datum vydání: 2005
Nakladatel: Václav Skala - UNION Agency
Typ dokumentu: article
článek
URI: http://wscg.zcu.cz/WSCG2005/Papers_2005/Journal/!WSCG2005_Journal_Final.pdf
http://hdl.handle.net/11025/1446
ISSN: 1213–6964 (online)
1213–6980 (CD-ROM)
1213–6972 (hardcover)
Klíčová slova: polygonální mřížky;výpočet vzdálenosti;Hausdorffova vzdálenost
Klíčová slova v dalším jazyce: polygonal meshes;distance calculation;Hausdorff distance
Abstrakt: 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.
Práva: © Václav Skala - UNION Agency
Vyskytuje se v kolekcích:Volume 13, Number 1-3 (2005)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Guthe.pdfPlný text334,29 kBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/1446

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.