Guarding galleries and terrains

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 181-192

  Efrat, Alon ^a   Har Peled, Sariel ^b  

^a University of Arizona   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

EFFICIENT APPROXIMATION ALGORITHMS; LINE SEGMENT; POLYGONS WITH HOLES; SIMPLE POLYGON; TWO-POINT;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 54349087002     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_16     Document Type: Article

References (25)

1. Aggarwal. The art gallery problem: Its variations, applications, and algorithmic aspects. PhD thesis, Dept. of Comput. Sci., Johns Hopkins University, Baltimore, MD, 1984.
2. H. Bronnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
3. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM, 43:1002-1045, 1996.
4. I Bjorling-Sachs, Variations on the Art Gallery Theorem. PhD thesis, Rutgers University, 1993.
5. B. Chazelle, Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6 (1991) 485-524.
6. K.L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., LNCS 709, 246-252, 1993.
7. M. de Berg. Generalized hidden surface removal. In Proc. 9th Annu. ACM Sympos. Comput Geom., pages 1-10, 1993.
8. M. de Berg, M. van Kreveld, M. H. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.
9. A. Efrat, F. Hoffmann, K. Kriegel, C. Knauer, G. Rote and C. Wenk, Covering Shapes by Ellipses ACM-SI AM Symposium on Discrete Algorithms, 2002, 453-454.
10. H. ElGindy and D. Avis. A linear algorithm for computing the visibility polygon from a point. J. Algorithms, 2:186-197, 1981.
11. S. Eidenbenz. (In-)Approximability of Visibility Problems on Polygons and Terrains. Phd thesis, diss. ETH no. 13683, 2000.
12. S. Eidenbenz. Approximation algorithms for Terrain Guarding Information Processing Letters (IPL) 82 (2002) 99-105.
13. Hector Gonzalez-Banos and Jean-Claude Latombe. A randomized art-gallery algorithm for sensor placement. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 232-240, 2001.
14. S. K. Ghosh. Approximation algorithms for art gallery problems. In Proc. Canadian Inform. Process. Soc. Congress, 1987.
15. L. Gewali, A. Meng, Joseph S. B. Mitchell, and S. Ntafos. Path planning in O/l/oo weighted regions with applications. ORSA J. Comput, 2(3):253-272, 1990.
16. F. Hoffmann, M. Kaufmann, and K. Kriegel. The art gallery theorem for polygons with holes. In Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., (1991) 39-48.
17. F. Hoffmann. On the rectilinear art gallery problem. In Proc. 17th Internat Colloq. Automata Lang. Program., LBNCS 443, 717-728, 1990.
18. S. Har-Peled. An output sensitive algorithm for discrete convex hulls. Comput Geom. Theory Appl., 10:125-138, 1998.
19. G. F. Jennings and W. J. Lenhart. An art gallery theorem for line segments in the plane. In G. T. Toussaint, editor, Pattern Recognition Letters Special Issue on Computational Geometry, 1993.
20. S. Kahan and J. Snoeyink. On the bit complexity of minimum link paths: Superquadratic algorithms for problems solvable in linear time. In Proc. 12th Annu. ACM Sympos. Comput. Geom., 151-158, 1996.
21. J. O'Rourke. An alternative proof of the rectilinear art gallery theorem. J. Geom., 21:118-130, 1983.
22. J. O'Rourke. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science. Oxford University Press, New York, NY, 1987.
23. J. O'Rourke and K. J. Supowit. Some NP-hard polygon decomposition problems. IEEE Trans. Inform. Theory, IT-30:181-190, 1983.
24. J. Urrutia. Art gallery and illumination problems. In Jorg-Rüdiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, 2000.
25. P. Valtr. Guarding galleries where no point sees a small area. Israel J. Math, 104:1-16, 1998.