Computing vision points in polygons

Algorithmica (New York)

Volumn 24, Issue 1, 1999, Pages 50-75

  Carlsson, S ^a   Nilsson, B J ^b  

^a LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Algorithms; Art gallery problems; Computational geometry

Indexed keywords

EID: 0012573211     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009271     Document Type: Article

References (28)

1. A. Aggarwal. The Art Gallery Theorem: Its Variations, Applications and Algorithmic Aspects. Ph.D. thesis, Johns Hopkins University, 1984.
2. S. Carlsson, H. Jonsson. Computing a Shortest Watchman Path in a Simple Polygon in Polynomial Time. In Proc. Workshop on Algorithms and Data Structures, WADS '95, pages 122-134. Lecture Notes in Computer Science, vol. 955. Springer-Verlag, Berlin, 1995.
3. S. Carlsson, H. Jonsson, B. J. Nilsson. Finding the Shortest Watchman Route in a Simple Polygon. In Proc. 4th International Symposium on Algorithms and Computation, ISAAC '93, pages 58-67. Lecture Notes in Computer Science, vol. 762. Springer-Verlag, Berlin, 1993.
4. S. Carlsson, B. J. Nilsson, S. Ntafos. Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. International Journal of Computational Geometry and Applications, 3(1):85-105, 1993.
5. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink. Ray Shooting in Polygons using Geodesic Triangulations. In Proc. 18th ICALP, pages 661-673, 1991.
6. B. Chazelle, L. Guibas. Visibility and Intersection Problems in Plane Geometry. Discrete and Computational Geometry, 4:551-581, 1989.
7. W. Chin, S. Ntafos. Optimum Watchman Routes. Information Processing Letters, 28:39-44, 1988.
8. V. Chvátal. A Combinatorial Theorem in Plane Geometry. Journal of Combinatorial Theory, Series B, 13(6):395-398, 1975.
9. D. Das, P. J. Heffernan, G. Narasimhan. LR-Visibility in Polygons. In Proc. 5th Canadian Conference on Computational Geometry, pages 303-308, 1993.
10. H. ElGindy, D. Avis. A Linear Algorithm for Computing the Visibility Polygon from a Point. Journal of Algorithms, 2:186-197, 1981.
11. S. Fisk. A Short Proof of Chvátal's Watchman Theorem. Journal of Combinatorial Theory, Series B, 24:374, 1978.
12. M. R. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
13. L. Guibas, J. Hershberger, D. Leven, M. Sharir, R. Tarjan. Linear Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons. Algorithmica, 2:209-233, 1987.
14. D. Harel, R. E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.
15. P. J. Heffernan. An Optimal Algorithm for the Two-Guard Problem. In Proc. 9th ACM Symposium on Computational Geometry, pages 348-358, 1993.
16. J. Hershberger, S. Suri. A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. In Proc. SODA, pages 54-63, 1993.
17. C. Icking, R. Klein. The Two Guards Problem. In Proc. 7th ACM Symposium on Computational Geometry, pages 166-175, 1991.
18. B. Joe, R. B. Simpson. Correction to Lee's Visibility Polygon Algorithm. BIT, 27:458-473, 1987.
19. J. M. Keil, J.-R. Sack. Minimum Decompositions of Polygonal Objects. In G. T. Toussaint, editor, Computational Geometry, pages 197-216. North-Holland, Amsterdam, 1985.
20. R. Klein. Walking an Unknown Street with Bounded Detour. Computational Geometry: Theory and Applications, 1(6):325-351, 1992.
21. D. T. Lee. Visibility of a Simple Polygon. Computer Vision, Graphics, and Image Processing, 22:207-221, 1983.
22. D. T. Lee, A. K. Lin. Computational Complexity of Art Gallery Problems. IEEE Transactions on Information Theory, IT-32:276-282, 1986.
23. D. T. Lee, F. P. Preparata. Euclidean Shortest Paths in the Presence of Rectilinear Barriers. Networks, 14:393-410, 1984.
24. B. J. Nilsson. Guarding Art Galleries - Methods for Mobile Guards. Ph.D thesis, Lund University, 1995.
25. B. J. Nilsson, D. Wood. Watchmen Routes in Spiral Polygons. Technical Report LU-CS-TR:90-55, Dept. of Computer Science, Lund University, 1990. An extended abstract of a preliminary version appears in Proc. 2nd Canadian Conference on Computational Geometry, pages 269-272, 1990.
26. B. J. Nilsson, D. Wood. Watchmen Routes in Spiral Polygons. Technical Report LU-CS-TR:90-55, Dept. of Computer Science, Lund University, 1990. An extended abstract of a preliminary version appears in Proc. 2nd Canadian Conference on Computational Geometry, pages 269-272, 1990.
27. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, Oxford, 1987.
28. T. C. Shermer. Recent Results in Art Galleries. Proceedings of the IEEE, pages 1384-1399, September 1992.