Finding a guard that sees most and a shop that sells most

Discrete and Computational Geometry

Volumn 37, Issue 4, 2007, Pages 545-563

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

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b University of Arizona   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247575298     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-007-1328-5     Document Type: Article

References (24)

1. H.-K. Ahn, S.-W. Cheng, O. Cheong, M. Golin, and R. van Oostrum. Competitive facility location: The Voronoi game. Theoret. Comput. Sci., 310:457-467, 2004.
2. N. Alon and J. H. Spencer. The Probabilistic Method, 2nd edition. Wiley Interscience, New York, 2000.
3. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Algorithmica, 21:89-103, 1998.
4. B. Aronov and S. Har-Peled. On approximating the depth and related problems. In Proc. ACM-SIAM Symp. Discrete Algorithms, pages 886-894, 2005.
5. M. de Berg, S. Cabello, P. Giannopoulos, C. Knauer, R. van Oostrum, and R. C. Veltkamp. Maximizing the area of overlap of two unions of disks under rigid motion. In Proc. Scandinavian Workshop on Algorithms, pages 138-149. LNCS, vol. 3111. Springer, Berlin, 2004.
6. M. de Berg, O. Cheong, O. Devillers, M. van Kreveld, and M. Teillaud. Computing the maximum overlap of two convex polygons under translations. Theory Comput. Systems, 31:613-628, 1998.
7. O. Cheong, S. Har-Peled, N. Linial, and J. Matousek. The one-round Voronoi game. Discrete Comput. Geom., 31:125-138, 2004.
8. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
9. E. Cohen, Y. Mansour, and M. Sharir. Approximation with relative errors in range spaces of finite VCdimension. Manuscript, 2006.
10. F. Dehne, R. Klein, and R. Seidel. Maximizing a Voronoi region: the convex case. Internat. J. Comput. Geom. Appl., 15:463-475, 2005.
11. A. Efrat and S. Har-Peled. Guarding galleries and terrains. Inform. Process. Lett., 100:238-245, 2006.
12. 2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165-185, 1995.
13. L. Gewali, A. Meng, J. S. B. Mitchell, and S. Ntafos. Path planning in 0/1/∞ weighted regions with applications. ORSA J. Comput., 2:253-272, 1990.
14. S. K. Ghosh. Approximation algorithms for art gallery problems. In Proc. Canadian Inform. Process. Soc. Congress, pages 429-434, 1987.
15. S. Har-Peled and M. Sharir. Relative ε-approximations in geometry. Manuscript. Available from http://www.uiuc.edu/~sariel/papers/06/integrate, 2006.
16. D. Hochbaum and A. Pathria. Analysis of the greedy approach in covering problems. Naval Res. Quart., 45:615-627, 1998.
17. Y. Li, P. M. Long, and A. Srinivasan. Improved bounds on the sample complexity of learning. J. Comput. System Sci., 62:516-527, 2001.
18. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
19. D. M. Mount, R. Silverman, and A. Y. Wu. On the area of overlap of translated polygons. Comput. Vision Image Understanding CVIU, 64:53-61, 1996.
20. S. C. Ntafos and M. Z. Tsoukalas. Optimum placement of guards. Inform. Sci., 76:141-150, 1994.
21. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edition. Probability and Statistics. Wiley, New York, 2000.
22. J. O'Rourke. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science. Oxford University Press, New York, 1987.
23. J. Urrutia. Art gallery and illumination problems. In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 973-1027. North-Holland, Amsterdam, 2000.
24. P. Valtr. Guarding galleries where no point sees a small area. Israel J. Math, 104:1-16, 1998.