Guarding Art Galleries: The Extra Cost for Sculptures is Linear - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

Guarding Art Galleries: The Extra Cost for Sculptures is Linear


Art gallery problems have been extensively studied over the last decade and have found different type of applications. Normally the number of sides of a polygon or the general shape of the polygon is used as a measure of the complexity of the problem. In this paper we explore another measure of complexity, namely, the number of guards required to guard the boundary, or the walls, of the gallery. We prove that if n guards are necessary to guard the walls of an art gallery, then an additional team of at most 4n − 6 will guard the whole gallery. This result improves a previously known quadratic bound, and is a step towards a possibly optimal value of n − 2 additional guards. The proof is algorithmic, uses ideas from graph theory, and is mainly based on the definition of a new reduction operator which recursively eliminates the simple parts of the polygon. We also prove that every gallery with c convex vertices can be guarded by at most 2c − 4 guards, which is optimal.
Fichier principal
Vignette du fichier
artgallery.pdf (223.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00325147 , version 1 (31-08-2010)



Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé. Guarding Art Galleries: The Extra Cost for Sculptures is Linear. SWAT: Scandinavian Workshop on Algorithm Theory, Jul 2008, Gothenburg, Sweden. pp.41-52, ⟨10.1007/978-3-540-69903-3_6⟩. ⟨lirmm-00325147⟩
330 View
275 Download



Gmail Facebook X LinkedIn More