Abstract
Given a terrain and a point p on or above it, we wish to compute the region R p that is visible from p. We present a generic radar-like algorithm for computing an approximation of R p . The algorithm interpolates the visible region between two consecutive rays (emanating from p) whenever the rays are close enough; that is, whenever the difference between the sets of visible segments along the cross sections in the directions specified by the rays is below some threshold. Thus the density of the sampling by rays is sensitive to the shape of the visible region. We suggest a specific way to measure the resemblance (difference) and to interpolate the visible region between two consecutive rays. We also present an alternative algorithm, which uses circles of increasing radii centered at p instead of rays emanating from p. Both algorithms compute a representation of the (approximated) visible region that is especially suitable for is-visible-from-p queries, i.e., given a query point q on the terrain determine whether q is visible from p. Finally, we report on the experiments that we performed with these algorithms and with their corresponding fixed versions, using a natural error measure. Our main conclusion is that the radar-like algorithm is significantly better than the others.
Similar content being viewed by others
References
B. Ben-Moshe, M.J. Katz, J.S.B. Mitchell, and Y. Nir. “Visibility preserving terrain simplification,” in Proc. 18th ACM Sympos. Comput. Geom., pp. 303–311, 2002.
M. De Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry, Algorithms and Applications. 2nd Edition, Springer: Berlin Heidelberg New York, 2000.
P. Bose, T. Shermer, G. Toussaint, and B. Zhu. “Guarding polyhedral terrains,” Computational Geometry Theory Application, Vol. 7:173–185, 1997.
D. Cohen-Or and A. Shaked. “Visibility and dead-zones in digital terrain maps,” Computer Graphics Forum, Vol. 14(3):171–179, 1995.
R. Cole and M. Sharir. “Visibility problems for polyhedral terrains,” Journal of Symbolic Computation, Vol. 7:11–30, 1989.
L. De Floriani and P. Magillo. “Visibility algorithms on triangulated digital terrain models,” International Journal of GIS, Vol. 8(1):13–41, 1994.
L. De Floriani and P. Magillo. “Representing the visibility structure of a polyhedral terrain through a horizon map,” International Journal of GIS, Vol. 10(5):541–562, 1996.
F. Devai. “Quadratic bounds for hidden line elimination,” in Proc. 2nd ACM Sympos. Comput. Geom., pp. 269–275, 1986.
W.R. Franklin. “Siting observers on terrain” Symp. Spatial Data Handling, 2002.
W.R. Franklin, C.K. Ray, and S. Mehta. “Geometric algorithms for siting of air defense missile batteries,” Tech. Report, 1994.
P.S. Heckbert and M. Garland. Fast polygonal approximation of terrains and height fields. Report CMU-CS-95-181, Carnegie Mellon University, 1995.
M.F. Goodchild and J. Lee. “Coverage problems and visibility regions on topographic surfaces,” Annals of Operation Research, Vol. 18:175–186, 1989.
N. Greene, M. Kass, and G. Miller. “Hierarchical z-buffer visibility,” Computer Graphics Proc., Annu. Conference Series, pp. 273–278, 1993.
M.J. Katz, M.H. Overmars, and M. Sharir. “Efficient hidden surface removal for objects with small union size,” Computational Geometry Theory Application, Vol. 2:223–234, 1992.
J. Reif and S. Sen. “An efficient output-sensitive hidden surface removal algorithm and its parallelization,” in Proc. 4th ACM Sympos. Comput. Geom., pp. 193–200, 1988.
M. Sharir. “The shortest watchtower and related problems for polyhedral terrains,” Information Processing Letters, Vol. 29:265–270, 1988.
A.J. Stewart. “Fast horizon computation at all points of a terrain with visibility and shading applications,” IEEE Transanctions Visualization Computer Graphics, Vol. 4(1):82–93, 1998.
U.S. Geological Survey (USGS) web site, Geographic Data Download page http://edc.usgs.gov/geodata/.
B. Zhu. “Computing the shortest watchtower of a polyhedral terrain in O(n log n) time,” Computational Geometry Theory Applications, Vol. 8:181–193, 1997.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ben-Moshe, B., Carmi, P. & Katz, M.J. Approximating the Visible Region of a Point on a Terrain. Geoinformatica 12, 21–36 (2008). https://doi.org/10.1007/s10707-006-0017-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10707-006-0017-5