Approximation algorithms for art gallery problems in polygons
Author:
- 1 March 2010
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (6) , 718-722
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Improved Approximations for Guarding 1.5-Dimensional TerrainsAlgorithmica, 2009
- Review of visibility algorithms in the plane by Subir Kumar Ghosh (Cambridge University Press, 2007)ACM SIGACT News, 2009
- Efficient visibility queries in simple polygonsComputational Geometry, 2002
- Edge guards in rectilinear polygonsComputational Geometry, 1998
- Generalized guarding and partitioning for rectilinear polygonsComputational Geometry, 1996
- Stationing guards in rectilinear art galleriesComputer Vision, Graphics, and Image Processing, 1984
- An alternate proof of the rectilinear art gallery theoremJournal of Geometry, 1983
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975