Skip to main content

Polygon Triangulation

Guarding an Art Gallery

  • Chapter
Computational Geometry

Abstract

Works of famous painters are not only popular among art lovers, but also among criminals. They are very valuable, easy to transport, and apparently not so difficult to sell. Art galleries therefore have to guard their collections carefully. During the day the attendants can keep a look-out, but at night this has to be done by video cameras. These cameras are usually hung from the ceiling and they rotate about a vertical axis. The images from the cameras are sent to TV screens in the office of the night watch. Because it is easier to keep an eye on few TV screens rather than on many, the number of cameras should be as small as possible. An additional advantage of a small number of cameras is that the cost of the security system will be lower. On the other hand we cannot have too few cameras, because every part of the gallery must be visible to at least one of them. So we should place the cameras at strategic positions, such that each of them guards a large part of the gallery. This gives rise to what is usually referred to as the Art Gallery Problem: how many cameras do we need to guard a given gallery and how do we decide where to place them?

An art gallery

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.C. (2000). Polygon Triangulation. In: Computational Geometry. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04245-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04245-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-04247-2

  • Online ISBN: 978-3-662-04245-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics