Covering grids and orthogonal polygons with periscope guards
- 30 April 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 2 (6) , 309-334
- https://doi.org/10.1016/0925-7721(93)90013-v
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Covering Polygons Is HardJournal of Algorithms, 1994
- On covering orthogonal polygons with star-shaped polygonsInformation Sciences, 1992
- Covering orthogonal polygons with star polygons: The perfect graph approachJournal of Computer and System Sciences, 1990
- Perfect Graphs and Orthogonally Convex CoversSIAM Journal on Discrete Mathematics, 1989
- On Gallery Watchmen in gridsInformation Processing Letters, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- Some properties of L-sets in the planeDuke Mathematical Journal, 1949