# Art gallery problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- STOC
- 2018

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial… (More)

Is this relevant?

2017

2017

- Symposium on Computational Geometry
- 2017

Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x… (More)

Is this relevant?

2017

2017

- 2017

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial… (More)

Is this relevant?

2016

2016

- ArXiv
- 2016

Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x… (More)

Is this relevant?

2014

2014

- CCCG
- 2014

For a polygonal region P with n vertices, a guard cover S is a set of points in P , such that any point in P can be seen from a… (More)

Is this relevant?

2013

2013

- COCOON
- 2013

The Art Gallery Problem (AGP) asks for placing a minimum number of stationary guards in a polygonal region P , such that all… (More)

Is this relevant?

2010

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… (More)

Is this relevant?

2009

2009

- 2009

We consider an Art Gallery problem (agp) which aims to minimize the number of vertex guards required to monitor an art gallery… (More)

Is this relevant?

2007

2007

- 2007

With the increasing interest in ubiquitous computing and mobile robotics, distributed algorithms for solving computational… (More)

Is this relevant?

2004

2004

- SIGGRAPH Posters
- 2004

In this proposal, a dense mesh of potential observers is placed in the open space that surrounds/immerses the obstacles in the… (More)

Is this relevant?