Title: An Improved Refinement and Decimation Method for Adaptive Terrain Surface Approximation
Authors: Pedrini, Hélio
Citation: WSCG '2001: Conference proceedings: The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001: University of West Bohemia, Plzen, Czech Republic, February 5.-9., 2001, p. 103-109.
Issue Date: 2001
Publisher: University of West Bohemia
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2001/Papers_2001/R216.ps.gz
ISBN: 80-7082-713-0
ISSN: 1213-6972
Keywords: zjednodušení plochy;triangulovaná nepravidelná mříž;optimalizace mřížky
Keywords in different language: surface simplification;triangulated irregular network;mesh optimization
Abstract: An improved method for adaptively constructing a terrain surface representation from a set of data points is presented . Refinement and decimation steps are repeatedly applied triangular meshes, incrementally determining a better distribution of the data points, while a specified arror tolerance is preserved. Even though not asymptomatically optimal or monotically convergent, it produces approximations that are, experimentally, significantly better than those generated by straightforward greedy insertion algorithms. A new local error metric is used ti select points to be inserted into the triangulation, based on the maximum vertical error weighted by the standard deviation calculated in a neighborhood of the candidate point. Controversely, a measure of angle between surface normals is used to determine whether a vertex should be removed from the triangulation. The method has been implemented and tested on both synthetic test cases and real terrain data sets.
Rights: © University of West Bohemia
Appears in Collections:WSCG '2001: Conference proceedings

Files in This Item:
File Description SizeFormat 
Pedrini.pdfPlný text1,36 MBAdobe PDFView/Open
Pedrini.psPlný text1,23 MBPostscriptView/Open

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

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