On the planar two-watchtower problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 121-130

  Bespamyatnikh, Sergei ^a   Chen, Zhixiang ^b   Wang, Kanliang ^c   Zhu, Binhai ^d  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

^c XI'AN JIAOTONG UNIVERSITY   (China)

^d Montana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

BOUNDED VARIABLES; CUBIC EQUATIONS; DISCRETE PROBLEMS; MONOTONE CHAIN; TIME ALGORITHMS;

TOWERS;

EID: 84944065850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_14     Document Type: Conference Paper

References (22)

1. M.J. Atallah, D.Z. Chen, and H. Wagner, An optimal parallel algorithm for the visibility of a simple polygon from a point, J. ACM, 38(3):516-533, 1991.
2. M. Bern, D. Dobkin, D. Eppstein, andR. Grossman, Visibility with a moving point of view, Algorithmica, 11:360-378, 1994.
3. P. Bose, T. Shermer, G. Toussaint, B. Zhu, Guarding polyhedral terrains, Comp. Geom. Theory and Appl., 7:173-186, 1997.
4. D.Z. Chen, V. Estivill-Castro and J. Urrutia, Optimal guarding of polygons andmonotone chains, Proc. 7th Canadian Conf. on Computational Geometry, pages 133-138, 1995.
5. R. Cole and M. Sharir, Visibility problems for polyhedral terrains, J. Symbolic Computation, 7:11-30, 1989.
6. H. ElGindy and D. Avis, A linear time algorithm for computing the visibility polygon from a point, J. Algorithms, 2(4):186-197, 1981.
7. S. Eidenbenz, C. Stamm and P. Widmayer, Positioning guards at fixed height above a terrain — andoptim um inapproximability result, Proc. 6th European Symp. on Algorithms (ESA’98), pages 187-198, 1998.
8. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, Linear time algorithms for visibility andshortest path problems inside triangulatedsimple polygons, Algorithmica, 2(2):209-234, 1987.
9. B. Joe, On the correction of a linear time visibility polygon algorithm, Intl. J. Comput. Math., 32:155-172, 1990.
10. B. Joe and R.B. Simpson, Correction to Lee’s visibility polygon algorithm, BIT, 27:458-473, 1987.
11. D.T. Lee, Visibility of a simple polygon, Comput. Vision Graph. Image Process., 22:207-221, 1983.
12. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30(4):852-965, 1983.
13. B. Nilsson, Guarding Art Galleries - Methods for Mobile Guards, Doctoral thesis, Department of Computer Science, Lund University, 1994.
14. J. O’Rourke, Art Gallery Theorems and Algorithms, OxfordUniv ersity Press, 1987.
15. J. O’Rourke, Computational geometry in C, Cambridge University Press, 1994.
16. J. O’Rourke, Vertex π-lights for monotone mountains, 9th Canadian Conference on Computational Geometry, Queen’s University, August 11-14, 1997. http://www.dgp.toronto.edu/cccg/cccg97/papers/5/5.html
17. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.
18. M. Sharir, The shortest watchtower andrelatedproblems for polyhedral terrains, Information Processing Letters, 29(5):265-270, 1988.
19. L. Valiant, Parallelism in comparison problems, SIAM J. Computing, 4:348-355, 1975.
20. C.A. Wang andB. Zhu, Three dimensional weak visibility: complexity and applications, Theoretical Computer Science, 234(1/2):219-232, 2000.
21. B. Zhu, Computing the shortest watchtower of a polyhedral terrain in O(n log n) time, Computational Geometry: Theory and Applications, 8:181-193, 1997.
22. B. Zhu, Computational Geometry in Two and a Half Dimensions, PhD thesis, School of Computer Science, McGill University, 1994.