Title: A local error bound approach to simplifying complex geometric models
Authors: Cox, John
Chibelushi, Claude C.
Citation: WSCG '2005: Posters: The 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005 in co-operation with EUROGRAPHICS, University of West Bohemia, Plzen, Czech Republic, p. 13-14.
Issue Date: 2005
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
conferenceObject
URI: http://wscg.zcu.cz/WSCG2005/Papers_2005/Poster/!WSCG2005_Poster_Proceedings_Final.pdf
http://hdl.handle.net/11025/888
ISBN: 80-903100-8-7
Keywords: zjednodušující algoritmus;komplexní geometrické modely
Keywords in different language: simplification algorithm;complex geometric models
Abstract: This paper presents a new error bound simplification algorithm for complex geometric models. A lower polygon count approximation of the input model is generated by performing edge collapse operations. The collapse vertex is constrained to lie within a localised tolerance volume built around the edge collapse neighbourhood. This constraint ensures that all points on the simplified surface are within a user specified distance from the surface after the previous edge collapse.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2005: Posters

Files in This Item:
File Description SizeFormat 
Cox.pdfPlný text90,32 kBAdobe PDFView/Open


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

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