Skip to search formSkip to main contentSkip to account menu

Art gallery problem

Known as: Museum guard problem, Chvatal's art gallery theorem, Art gallery theorem 
The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from a real-world problem of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
During the 2010/2011 Canterbury earthquakes, several reinforced concrete (RC) walls in multi-storey buildings formed a single… 
2013
2013
The Art Gallery Problem (AGP) asks for placing a minimum number of stationary guards in a polygonal region $$P$$P, such that all… 
2010
2010
The art gallery problem asks for the smallest number of guards required to see every point of the interior of a polygon P . We… 
2010
2010
The classical Art Gallery Problem asks for the minimum number of guards that achieve visibility coverage of a given polygon. This… 
Review
2008
Review
2008
The main objective of this study was to investigate the prevalence of diseases culminating with death or motivating euthanasia of… 
Highly Cited
2008
Highly Cited
2008
Abstract The São Luís Craton and the Palaeoproterozoic basement rocks of the Neoproterozoic Gurupi Belt in northern Brazil are… 
2006
2006
A vacuum frame, comprising a base section, a cover hingeably attached to the base section and including a transparent section… 
1994
1994
In an art gallery there are priceless paintings, and therefore the whole museum must constantly be under surveillance: How many… 
1990
1990
It is shown that [n/4] point guards are always sufficient and sometimes necessary to watch a rectilinear polygon with an…