Hierarchical triangulation using cartographic coherence
CVGIP: Graphical Models and Image Processing
Visibility-related image features
Pattern Recognition Letters
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
On levels of detail in terrains
Graphical Models and Image Processing
Greedy cuts: an advancing front terrain triangulation algorithm
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
An efficient algorithm for terrain simplification
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications
IEEE Transactions on Visualization and Computer Graphics
Automatic extraction of Irregular Network digital terrain models
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Automatic generation of triangular irregular networks using greedy cuts
VIS '95 Proceedings of the 6th conference on Visualization '95
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry: Theory and Applications
Efficient viewshed computation on terrain in external memory
Geoinformatica
Geometric heuristics for rural radio maps approximation
Journal of Heuristics
On IO-efficient viewshed algorithms and their accuracy
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
The terrain surface simplification problem has been studied extensively, as it has important applications in geographic information systems and computer graphics. The goal is to obtain a new surface that is combinatorially as simple as possible, while maintaining a prescribed degree of similarity with the original input surface. Generally, the approximation error is measured with respect to distance (e.g., Hausdorff) from the original or with respect to visual similarity. In this paper, we propose a new method of simplifying terrain surfaces, designed specifically to maximize a new measure of quality based on preserving inter-point visibility relationships. Our work is motivated by various problems of terrain analysis that rely on inter-point visibility relationships, such as optimal antenna placement.We have implemented our new method and give experimented evidence of its effectiveness in simplifying terrains according to our quality measure. We experimentally compare its performance with that of other leading simplification methods.