Cooperative mobile guards in grids
- 31 July 2007
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 37 (2) , 59-71
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Orthogonal segment stabbingComputational Geometry, 2005
- Art gallery theorems for guarded guardsComputational Geometry, 2003
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segmentsInformation Processing Letters, 1998
- An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygonsInformation Processing Letters, 1994
- Covering grids and orthogonal polygons with periscope guardsComputational Geometry, 1993
- On Gallery Watchmen in gridsInformation Processing Letters, 1986
- Planar 3DM is NP-completeJournal of Algorithms, 1986
- Galleries need fewer mobile guards: A variation on Chv tal's theoremGeometriae Dedicata, 1983
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975