Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
Real-time, continuous level of detail rendering of height fields
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
ROAMing terrain: real-time optimally adapting meshes
VIS '97 Proceedings of the 8th conference on Visualization '97
Large scale terrain visualization using the restricted quadtree triangulation
Proceedings of the conference on Visualization '98
Interactive view-dependent rendering of large isosurfaces
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
Real-Time Optimal Adaptation for Planetary Geometry and Texture: 4-8 Tile Hierarchies
IEEE Transactions on Visualization and Computer Graphics
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Planet-Sized Batched Dynamic Adaptive Meshes (P-BDAM)
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
ACM SIGGRAPH 2006 Papers
Survey of semi-regular multiresolution models for interactive terrain rendering
The Visual Computer: International Journal of Computer Graphics
Dynamic hierarchical triangulation of a clustered data stream
Computers & Geosciences
Computing morse decompositions for triangulated terrains: an analysis and an experimental evaluation
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
GPU algorithms for diamond-based multiresolution terrain processing
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
Hi-index | 0.00 |
Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider Sparse Terrain Pyramids as a compact multiresolution representation for terrain datasets whose samples are a subset of those lying on a regular grid. While previous diamond-based approaches can efficiently represent meshes built on a complete grid of resolution (2k +1)2, this is not suitable when the field values are uniform in large areas or simply non-existent. We explore properties of diamonds to simplify an encoding of the implicit dependency relationship between diamonds. Additionally, we introduce a diamond clustering technique to further reduce the geometric and topological overhead of such representations. We demonstrate the coherence of our clustering technique as well as the compactness of our representation.