Guarding curvilinear art galleries with vertex or point guards

  title={Guarding curvilinear art galleries with vertex or point guards},
  author={Menelaos I. Karavelas and Elias P. Tsigaridas},
  journal={Comput. Geom.},
One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our main focus is on polygons the edges of which are convex arcs pointing towards the exterior or interior… CONTINUE READING
7 Citations
39 References
Similar Papers


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

Illumination of convex discs

  • L. Fejes Tóth
  • Acta Math. Acad. Sci. Hungar.,
  • 1977
Highly Influential
3 Excerpts

Art Gallery Theorems and Algorithms

  • J. O’Rourke
  • The International Series of Monographs on…
  • 1987
Highly Influential
4 Excerpts

Sitchinava . Guard placement for efficient pointinpolygon proofs

  • D. Eppstein, M. T. Goodrich, andN.
  • Proc . 23 rd Annu . ACM Sympos . Comput . Geom .
  • 2007

Illumination of convex discs , Acta Math

  • L. Fejes Tóth
  • Handbook of Computational Geometry
  • 2000

Zaks . Illuminating convex sets

  • J.
  • 2000

Similar Papers

Loading similar papers…