Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8422
Title: Constructing multi-resolution triangulated irregular network model for visualization
Authors: Yang, B
Li, Q
Shi, W 
Keywords: 3D visualization
Edge collapses/vertex spits
Multi-resolution
TIN
Issue Date: 2005
Publisher: Pergamon Press
Source: Computers & geosciences, 2005, v. 31, no. 1, p. 77-86 How to cite?
Journal: Computers & geosciences 
Abstract: It is essential to generate multi-resolution triangulated irregular network (TIN) models dynamically and efficiently in three-dimensional (3D) visualization, virtual reality (VR), and geographic information systems (GIS), because the data processed is multiple in scale and large in volume. This paper proposes a new approach, which extends the iterative edge collapses and vertex splits algorithm, to dynamically generate multi-resolution TIN models. Moreover, a new method was proposed to improve the efficiency of vertex topological relationships storing in multi-resolution TIN models. And a set of rules were defined to improve the validity judgment of vertex splits and edge collapses. To evaluate the performance of the proposed approach, the root mean square error (RMSE) of the elevation of vertex and the quality of the shapes of triangles were measured to evaluate the quality of a generated multi-resolution TIN model. The experimental results demonstrate that the proposed approach can generate multi-resolution TIN models with a higher accuracy and better time performance.
URI: http://hdl.handle.net/10397/8422
ISSN: 0098-3004
EISSN: 1873-7803
DOI: 10.1016/j.cageo.2004.09.011
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
Citations as of Oct 8, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Oct 17, 2017

Page view(s)

46
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



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