Authors:
Troy F. Alderson
and
Faramarz F. Samavati
Affiliation:
University of Calgary, Canada
Keyword(s):
Terrain Simplification, Line of Sight, Reverse Subdivision.
Related
Ontology
Subjects/Areas/Topics:
Computer Vision, Visualization and Computer Graphics
;
Fundamental Methods and Algorithms
;
Geometry and Modeling
;
Multi-Resolution Modeling
Abstract:
Certain applications require knowledge of whether two entities are visible to each other over a terrain, determined using a line-of-sight computation. Several fast algorithms exist for terrain line-of-sight computations. However, performing numerous line-of-sight computations, particularly over a large terrain data set, can be highly resource-intensive (in run time and/or memory). Methods from the field of terrain simplification can be used to reduce the resource impact of the visibility algorithms. To take advantage of the especially fast algorithms that exist for regular terrain models, we introduce regularity-preserving terrain simplification methods based on reverse subdivision, including a novel reverse subdivision algorithm designed to maximize visibility test accuracy, and compared the resulting visibility test output to several terrain simplification methods. Additionally, the positions of the entities after simplification can have a significant impact on the visibility test
results. Hence, we have experimented with different functions that change the positions of the test points in an attempt to maximize visibility test accuracy after simplification.
(More)