Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Adaptive view dependent tessellation of displacement maps
HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Hardware support for adaptive subdivision surface rendering
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Cell-projection of cyclic meshes
Proceedings of the conference on Visualization '01
Visualization of large terrains made easy
Proceedings of the conference on Visualization '01
QuadTIN: quadtree based triangulated irregular networks
Proceedings of the conference on Visualization '02
Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization
IEEE Transactions on Visualization and Computer Graphics
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Modeling and visualization of complex geometric environments
Geometric modeling
Geometry clipmaps: terrain rendering using nested regular grids
ACM SIGGRAPH 2004 Papers
IEEE Computer Graphics and Applications
Planet-Sized Batched Dynamic Adaptive Meshes (P-BDAM)
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Dynamic hybrid terrain representation based on convexity limits identification
International Journal of Geographical Information Science
Hi-index | 0.00 |
Hybrid digital terrain models represent an effective framework to combine and integrate terrain data with different topology and resolution. Cartographic digital terrain models typically are constituted by regular grid data and can be refined by adding locally TINs that represent morphologically complex terrain parts. Direct rendering of both data sets to visualize the digital terrain model would generate geometric discontinuities as the meshes are disconnected. In this paper we present a new meshing scheme for hybrid terrain representations. High quality models without discontinuities are generated as the different representations are softly joined through an adaptive tessellation procedure. Due to the complexity of the algorithms involved in the tessellation procedure, we propose a mixed strategy where part of the information is pre-computed and efficiently encoded. This way, for rendering the model, the tessellation information has to be decoded and only additional simple operations have to be performed.