On Finding a Guard that Sees Most and a Shop that Sells Most

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 1091-1100

  Cheong, Otfried ^a   Efrat, Alon ^b   Har Peled, Sariel ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b University of Arizona   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; ERROR ANALYSIS; FUNCTIONS; GRAPH THEORY; PROBABILITY; QUADRATIC PROGRAMMING; SENSORS;

POLYGONS; VORONOI REGION;

PROBLEM SOLVING;

EID: 1842538784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. +01] H.-K. Ahn, S.-W. Cheng, O. Cheong, M. Golin, and R. van Oostrum. Competitive facility location along a highway. In 7th Annual International Computing and Combinatorics Conference, volume 2108 of LNCS, pages 237-246, 2001.
2. [AFRW98] H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Algorithmica, 21:89-103, 1998.
3. [AS00] N. Alon and J. H. Spencer. The probabilistic method. Wiley Inter-Science, 2nd edition, 2000.
4. [CHLM02] O. Cheong, S. Har-Peled, N. Linial, and J. Matoušek. The one-round Voronoi game. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 97-101, 2002.
5. [CS89] K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
6. +98] M. de Berg, O. Cheong, O. Devillers, M. van Kreveld, and M. Teillaud. Computing the maximum overlap of two convex polygons under translations. Theo. Comp. Sci., 31:613-628, 1998.
7. +03] M. de Berg, P. Giannopoulos, C. Knauer, R. van Oostrum, and R. C. Veltkamp. Maximizing the area of overlap of two unions of convex homothets under translation. Manuscript, 2003.
8. [DKS02] F. Dehne, R. Klein, and R. Seidel. Maximizing a Voronoi region: The convex case. In Proc. 13th Annu. Internat. Sympos. Algorithms Comput., pages 624-634, 2002.
9. [EH02] A. Efrat and S. Har-Peled. Locating guards in art galleries. 2nd IFIP Internat. Conf. Theo. Comp. Sci., pages 181-192, 2002.
10. [Gho87] S. K. Ghosh. Approximation algorithms for art gallery problems. In Proc. Canadian Inform. Process. Soc. Congress, 1987.
11. [GMMN90] L. Gewali, A. Meng, J. S. B. Mitchell, and S. Ntafos. Path planning in 0/l/∞ weighted regions with applications. ORSA J. Computing, 2:253-272, 1990.
12. 2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165-185, 1995.
13. [HP98] D. Hochbaum and A. Pathria. Analysis of the greedy approach in covering problems. Naval Research Quarterly, 45:615-627, 1998.
14. [KLPS86] K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
15. [MR95] R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
16. [MSW96] D. M. Mount, R. Silverman, and A. Y. Wu. On the area of overlap of translated polygons. Computer Vision and Image Understanding: CVIU, 64(1):53-61, 1996.
17. [NT94] S. C. Ntafos and M. Z. Tsoukalas. Optimum placement of guards. Info. Sciences, 76:141-150, 1994.
18. [OBSC00] A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial tessellations: Concepts and applications of Voronoi diagrams. Probability and Statistics. Wiley, 2nd edition edition, 2000.
19. [OPP03] The open problems project. Problem 33: Sum of square roots. http://cs.smith.edu/~orourke/TOPP/P33.html, 2003.
20. [O'R87] J. O'Rourke. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science. Oxford University Press, New York, NY, 1987.
21. [Urr00] J. Urrutia. Art gallery and illumination problems. In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, 2000.
22. [Val98] P. Valtr. Guarding galleries where no point sees a small area. Israel J. Math, 104:1-16, 1998.