Guarding a terrain by two watchtowers

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 346-355

  Agarwal, Pankaj K ^a   Bereg, Sergey ^b   Daescu, Ovidiu ^b   Kaplan, Haim ^c   Ntafos, Simeon ^b   Zhu, Binhai ^d  

^a Duke University   (United States)

^b The University of Texas at Dallas   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d Idaho National Laboratory   (United States)

Author keywords

Art gallery; Computational geometry; Parametric search; Terrain guarding; Visibility algorithms

Indexed keywords

ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING;

ART GALLERY; PARAMETRIC SEARCH; TERRAIN GUARDING; VISIBILITY ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 33244477413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064145     Document Type: Conference Paper

References (21)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing and C. Yap, Parallel computational geometry, Algorithmica 3 (1988), 293-328.
2. n and the discrete planar two-watchtower problem, Inform. Process. Lett. 89 (2004), 137-139,
3. B. Ben-Moshe, M. J. Katz, and J.S.B. Mitchell, A constant-factor approximation algorithm for optimal terrain guarding, In P roc. 16th ACM-SIAM Symp. Discrete Algorithms, 2005, pp. 515-524.
4. S. Bespamyatnikh, Z. Chen, K. Wang, and B. Zhu, On the planar two-watchtower problem, In Proc. 7th Ann. Internat. Conf. Computing and Combinatorics, pp. 121-130, 2001.
5. B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551-581.
6. D.Z. Chen and O. Daescu, Maintaining visibility of a polygon with a moving point of view, Inform. Process. Lett., 65 (1998), 269-275.
7. D.Z. Chen, V. Estivvill-Castro and J. Urrutia, Optimal guarding of polygons and monotone chains, Proc. 7th Canadian Conf. on Comput. Geom., 133-138, 1995.
8. K. Clarkson and K. Varadarajan, Improved approximation algorithms for geometric set cover, these proceedings.
9. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM 34 (1987), 200-208.
10. R. Cole and M. Sharir, Visibility problems for polyhedral terrains, J. Symbolic Comput., 7 (1989), 11-30.
11. D. P. Dobkin and D. G. Kirkpatrick, Fast detection of polyhedral intersection, Theoretical Computer Science 27 (1983), 241-253.
12. S.J. Eidenbenz, C. Stamm, and P. Widmayer, Inapproximability results for guarding polygons and terrains. Algorithmica 31 (2001), 79-113
13. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987), 209-233.
14. J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Inform. Process. Lett. 33 (1989), 169-174.
15. J. Matousek, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), 157-182.
16. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983), 852-865.
17. M.H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23 (1981), 166-204.
18. M. Sharir, The shortest watchtower and related problems for polyhedral terrains, Inform. Process. Lett., 29(5) (1988), 265-270.
19. M. Sharir and P.K. Agarwal, Davenport Schimel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
20. J. Urrutia, Art gallery and illumination problems, in Handbook on Computational Geometry, Elsevier Science Publishers, J.R. Sack and J. Urrutia, eds., pp. 973-1026, 2000.
21. B. Zhu, Computing the shortest watchtower of a polyhedral terrain in O (n log n) time, Comput. Geom. Theory Appls., 8 (1997), 181-193.