论文信息 - On the Rectilinear Art Gallery Problem - Algorithmic Aspects

On the Rectilinear Art Gallery Problem - Algorithmic Aspects

We investigate the watchman problem for rectilinear art galleries with an arbitrary number of holes. An efficient algorithm for the placement of the guards with running time O(n3/2 log2n log log n) is presented. Each guard has to watch an r-star of constant size.

Michael Kaufmann | Frank Hoffmann

[1] J. O'Rourke. Art gallery theorems and algorithms , 1987 .

[2] Frank Hoffmann,et al. On the Rectilinear Art Gallery Problem (Extended Abstract) , 1990, ICALP.

[3] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .

[4] Godfried T. Toussaint,et al. Guard Placement in Rectilinear Polygons , 1988 .

[5] Prof. Dr. Kurt Mehlhorn,et al. Data Structures and Algorithms 3 , 2012, EATCS Monographs on Theoretical Computer Science.

[6] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[7] Ervin Györi. A short proof of the rectilinear art gallery theorem , 1986 .