Name
Abstract | ||
|---|---|---|
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem is well known and has a linear time solution for the 2D case, but little is known in the 3D case. In this paper we present a polynomial time solution for the 3D version of the Art Gallery Problem. Because the problem is NP-hard, the solution presented is an approximation, and we present the bounds to our solution. The solution uses techniques from: (i) computational geometry to first build a terrain hierarchy keeping the overall terrain's shape and to compute the visibility map for each observer; (ii) graph coloring to make a first placement of observers on the terrain; and (iii) set coverage to reduce the number of observers based on their visibility map. A complexity analysis is presented for each step and an analysis of the overall quality of the solution is given. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0262-8856(99)00045-1 | Image and Vision Computing |
Keywords | Field | DocType |
Polyhedral terrain,Polynomial time,Art gallery problem | Art gallery problem,Computational geometry,Terrain,Polyhedral terrain,Artificial intelligence,Time complexity,Hierarchy,Graph coloring,Computer vision,Mathematical optimization,Algorithm,Observer (quantum physics),Mathematics | Journal |
Volume | Issue | ISSN |
18 | 10 | 0262-8856 |
Citations | PageRank | References |
44 | 8.38 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maurício Marengoni | 1 | 96 | 19.02 |
| Bruce A. Draper | 2 | 2001 | 207.57 |
| A. Hanson | 3 | 1348 | 304.11 |
| Ramesh K. Sitaraman | 4 | 1928 | 141.68 |