Covering Grids and Orthogonal Polygons with Periscope Guards

@article{Gewali1992CoveringGA,
  title={Covering Grids and Orthogonal Polygons with Periscope Guards},
  author={Laxmi P. Gewali and Simeon C. Ntafos},
  journal={Comput. Geom.},
  year={1992},
  volume={2},
  pages={309-334}
}
Gewali, L.P. and S. Ntafos, Covering grids and orthogonal polygons with periscope guards, Computational Geometry: Theory and Applications 2 (1993) 309-334. The problem of finding minimum guard covers is NP-hard for simple polygons and open for simple orthogonal polygons. Alternative definitions of visibility have been considered for orthogonal polygons. In this paper we try to determine the complexity of finding guard covers in orthogonal polygons by considering periscope visibility. Under… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Visibility properties of polygons

  • T. Shermer
  • Ph.D. Thesis, McGill University,
  • 1989

Guard placement in rectilinear polygons, in: Computational Morphology (North-Holland

  • J.-R. Sack, G. T. Toussaint
  • 1988

Reckhow, Covering polygons is hard

  • R.A.J.C. Culberson
  • Annual Symposium on Foundations of Computer…
  • 1988

Art Gallery Theorems and Algorithms

  • J. O’Rourke
  • 1987

On gallery watchman in grids , Inform

  • J. O’Rourke, K. J. Supowit
  • Process . Lett .
  • 1986

The art gallery theorem: its variations, applications and algorithmic aspects, Ph.D

  • A. Aggarwal
  • The power of geometric duality,
  • 1984

Similar Papers

Loading similar papers…