A new method for quadtree triangulation

Authors:
Refik Samet;Emrah Ozsavas
Affiliations:
Department of Computer Engineering, Ankara University, Ankara, Turkey;Department of Computer Engineering, Ankara University, Ankara, Turkey
Venue:
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
Year:
2007

Citing 8
Cited 1

ROAMing terrain: real-time optimally adapting meshes

VIS '97 Proceedings of the 8th conference on Visualization '97
Navigating through triangle meshes implemented as linear quadtrees

ACM Transactions on Graphics (TOG)
QuadTIN: quadtree based triangulated irregular networks

Proceedings of the conference on Visualization '02
Terrain Decimation through Quadtree Morphing

IEEE Transactions on Visualization and Computer Graphics
Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization

IEEE Transactions on Visualization and Computer Graphics
Managing Large Terrain Data Sets with a Multiresolution Structure

DEXA '00 Proceedings of the 11th International Workshop on Database and Expert Systems Applications
Right Triangular Irregular Networks

Right Triangular Irregular Networks
OpenGL SuperBible (3rd Edition)

OpenGL SuperBible (3rd Edition)

Web based real-time meteorological data analysis and mapping information system

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of the study is to increase the accuracy of a terrain triangulation while maintaining or reducing the number of triangles. To this end, a new non-trivial algorithm for quadtree triangulation is proposed. The proposed algorithm includes: i) a resolution parameters calculation technique and ii) three error metric calculation techniques. Simulation software is also devised to apply the proposed algorithm. For this purpose a data file is processed via the software. Initially, a data file is read to obtain the elevation data of a terrain. After that, 3D mesh is generated by using the original algorithm and the proposed algorithm. For each of the algorithms, two states are analyzed: i) the state with fixed resolution parameters and ii) the state with dynamically changing resolution parameters. For all of the cases, terrain accuracy value and number of triangles of 3D meshes are calculated and evaluated. Finally, it is shown that dynamically changing resolution parameters improve the algorithms' performance.