Computational geometry: an introduction
Computational geometry: an introduction
Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
An efficient output-sensitive hidden surface removal algorithm and its parallelization
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Minimal roughness property of the Delaunay triangulation
Computer Aided Geometric Design
Efficient hidden surface removal for objects with small union size
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
On levels of detail in terrains
Proceedings of the eleventh annual symposium on Computational geometry
Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Ray Shooting, Depth Orders and Hidden Surface Removal
Ray Shooting, Depth Orders and Hidden Surface Removal
A Pyramidal Data Structure for Triangle-Based Surface Description
IEEE Computer Graphics and Applications
A Simplified Technique for Hidden-Line Elimination in Terrains
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A Hierarchical Triangle-Based Model for Terrain Description
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
Variable Resolution Terrain Surfaces
Proceedings of the 8th Canadian Conference on Computational Geometry
Hierarchical triangulation using terrain features
VIS '90 Proceedings of the 1st conference on Visualization '90
Visibility preserving terrain simplification: an experimental study
Proceedings of the eighteenth annual symposium on Computational geometry
Feature-Based Visibility-Driven CLOD for Terrain
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
A partition-based serial algorithm for generating viewshed on massive DEMs
International Journal of Geographical Information Science
Exploring multiple viewshed analysis using terrain features and optimisation techniques
Computers & Geosciences
Analysing potential field data using visibility
Computers & Geosciences
| Hi-index | 0.00 |
Hierarchical terrain models provide a multiresolution descriptionof a topographic surface based on a nested partition of the domain. Thetree-like structure of these models is an effective support to processingspatial operations. In this paper, we consider visibility computations onhierarchical terrain models based on triangular subdivisions, calledHierarchical Triangulated Irregular Networks (HTINs). We address two basicproblems in visibility computation, namely determining the visibility of aquery object, and computing the viewshed of a given viewpoint. We proposealgorithms for performing such operations on an HTIN at variable resolution.A general drawback of hierarchical models is in the inconsistency ofrepresentations at variable resolution obtained from them, since verticalgaps may occur at edges where different resolutions meet. The algorithmsproposed here avoid this undesired effect. A related, but independent,contribution of this paper is also a new algorithm for extracting aconsistent terrain representation at variable resolution from an HTIN.