Four-triangles adaptive algorithms for RTIN terrain meshes

Authors:
J. P. SuáRez;A. Plaza
Affiliations:
Department of Cartography and Graphic Engineering, University of Las Palmas de Gran Canaria, 35017-Las Palmas de Gran Canaria, Spain;Department of Mathematics, University of Las Palmas de Gran Canaria, Spain
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2009

Citing 9
Cited 2

Real-time, continuous level of detail rendering of height fields

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
The 4-triangles longest-side partition of triangles and linear refinement algorithms

Mathematics of Computation
Large scale terrain visualization using the restricted quadtree triangulation

Proceedings of the conference on Visualization '98
QuadTIN: quadtree based triangulated irregular networks

Proceedings of the conference on Visualization '02
Mesh quality improvement and other properties in the four-triangles longest-edge partition

Computer Aided Geometric Design
A boundary and soil interface conforming unstructured local mesh refinement for geological structures

Finite Elements in Analysis and Design
An adaptive multigrid approach for the simulation of contaminant transport in the 3D subsurface

Computers & Geosciences
Adaptive mesh refinement for the control of cost and quality in finite element analysis

Finite Elements in Analysis and Design
4-8 Subdivision

Computer Aided Geometric Design

Forecasting and visualization of wildfires in a 3D geographical information system

Computers & Geosciences
A continuative variable resolution digital elevation model for ground-based photogrammetry

Computers & Geosciences

Quantified Score

Hi-index	0.98

Visualization

Abstract

We present a refinement and coarsening algorithm for the adaptive representation of Right-Triangulated Irregular Network (RTIN) meshes. The refinement algorithm is very simple and proceeds uniformly or locally in triangle meshes. The coarsening algorithm decreases mesh complexity by reducing unnecessary data points in the mesh after a given error criterion is applied. We describe the most important features of the algorithms and give a brief numerical study on the propagation associated with the adaptive scheme used for the refinement algorithm. We also present a comparison with a commercial tool for mesh simplification, Rational Reducer, showing that our coarsening algorithm offers better results in terms of accuracy of the generated meshes.