Visibility Queries in Simple Polygons and Applications

  • Authors:
  • Boris Aronov;Leonidas J. Guibas;Marek Teichmann;Li Zhang

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P. We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadraticspace data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubic space overhead of earlier methods. The same canonical decomposition can be used to determine visibility within a frustum, or to compute various attributes of the visibility polygon efficiently. By exploring the connection between visibility polygons and shortest path trees, we obtain a kinetic algorithm that can track the visibility polygon as the viewpoint moves along polygonal paths inside P, at a polylogarithmic cost per combinatorial change in the visibility. The combination of the static and kinetic algorithms leads to a space query-time tradeoff for the visibility from a point problem and an output-sensitive algorithm for the weak visibility from a segment problem.