Region Intervisibility in Terrains

A polyhedral terrain is the graph of a continuous piecewise linear function defined over the triangles of a triangulation in the xy-plane. Two points on or above a terrain are visible to each other if the line-of-sight does not intersect the space below the terrain. In this paper, we look at three related visibility problems in terrains. Suppose we are given a terrain T with n triangles and two regions R1 and R2 on T, i.e., two simply connected subsets of at most m triangles. First, we present an algorithm that determines, for any constant ∊ > 0, within O(n1+∊m) time and storage whether or not R1 and R2 are completely intervisible. We also give an O(m3n4) time algorithm to determine whether every point in R1 sees at least one point in R2. Finally, we present an O(m2n2log n) time algorithm to determine whether there exists a pair of points p ∈ R1 and q ∈ R2, such that p and q see each other.

[1]  W. Randolph Franklin.  Higher isn ’ t Necessarily Better : Visibility Algorithms and Experiments , 1994 .

[2]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[3]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[4]  Joseph S. B. Mitchell,et al.  Visibility preserving terrain simplification: an experimental study , 2002, SCG '02.

[5]  David M. Mount.  Geometric Intersection , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[6]  Sergey Bereg,et al.  On the Planar Two-Watchtower Problem , 2001, COCOON.

[7]  TerrainsLeila De Floriani,et al.  Intervisibility on Terrains , 1999 .

[8]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.

[9]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[10]  Mark de Berg,et al.  Sparse Arrangements and the Number of Views of Polyhedral Scenes , 1997, Int. J. Comput. Geom. Appl..

[11]  David P. Lanter,et al.  Two algorithms for determining partial visibility and reducing data structure induced error in viewshed analysis , 1993 .

[12]  Sergey Bereg,et al.  Guarding a Terrain by Two Watchtowers , 2008, Algorithmica.

[13]  Jay Lee.  Analyses of visibility sites on topographic surfaces , 1991, Int. J. Geogr. Inf. Sci..

[14]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[15]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[16]  John H. Reif,et al.  An efficient output-sensitive hidden surface removal algorithm and its parallelization , 1988, SCG '88.

[17]  Matthew J. Katz,et al.  Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem , 2004, Inf. Process. Lett..

[18]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[19]  PETER F. FISHER,et al.  Algorithm and Implementation Uncertainty in Viewshed Analysis , 1993, Int. J. Geogr. Inf. Sci..

[20]  Ron Y. Pinter,et al.  Polygon Triangulation: Efficiency and Minimality , 1986, J. Algorithms.

[21]  Micha Sharir,et al.  On the number of views of polyhedral terrains , 1993, CCCG.

[22]  Robert L. Grossman,et al.  Visibility with a moving point of view , 1994, SODA '90.

[23]  Leonidas J. Guibas,et al.  Lines in space: Combinatorics and algorithms , 2005, Algorithmica.

[24]  J. Koenderink,et al.  The internal representation of solid shape with respect to vision , 1979, Biological Cybernetics.