Efficient visibility queries in simple polygons

Computational Geometry: Theory and Applications

Volumn 23, Issue 3, 2002, Pages 313-335

  Bose, Prosenjit ^a   Lubiw, Anna ^b   Lan Munro, J ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33244479932     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00070-0     Document Type: Article

References (33)

1. A. Aggarwal, The art gallery theorem: its variations, applications, and algorithmic aspects, Ph.D. Thesis, Johns Hopkins University, 1984.
2. T. Asano, T. Asano, L. Guibas, J. Hershberger, H. Imai, Visibility of disjoint polygons, Algorithmica 1 (1986) 49-63.
3. D. Avis, G. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput 30 (12) (1981) 910-914.
4. P. Belleville, Computing two-covers of simple polygons, Masters Thesis, McGill University, 1991.
5. J.L. Bentley, Th. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. 28 (1979) 643-647.
6. LA. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier Science, New York, 1976.
7. P. Böse, Visibility in simple polygons, Masters Thesis, Research Report CS-91-61, University of Waterloo, December 1991.
8. P. Bose, A. Lubiw, J.I. Munro, Efficient visibility queries in simple polygons, in: Proc. 4th Canadian Conference on Computational Geometry, St. Johns, Nfld, 1992, pp. 23-28.
9. K.W. Bowyer, C.R. Dyer, Aspect graphs: An introduction and survey of recent results, Internat. J. Imaging Systems and 2 (1990) 315-328.
10. B. Chazelle, A theorem on polygon cutting with applications, in: Proc. 23rd Annual IEEE Symposium on the Foundations of Computer Science, 1982, pp. 339-349.
11. B. Chazelle, L. Guibas, D. Lee, The power of geometric duality, in: Proc. 24th Annual IEEE Symposium on Foundations of Computer Science, 1983, pp. 217-225.
12. B. Chazelle, An improved algorithm of the fixed-radius neighbor problem, Inform. Process. Lett. 16 (1983) 193-198.
13. B. Chazelle, L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 ( 1989) 551-581.
14. B. Chazelle, H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, in: Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 217-225.
15. V. Chvatal, A combinatorial theorem in plane geometry, J. Combin. Theory Ser. B 18 (1975) 39-1.
16. H. ElGindy, D. Avis, A linear algorithm for computing the visibility polygon from a point, J. Algorithms 2 (1981) 186-197.
17. L. Guibas, J. Hershberger, D. Leven, M. Sharir, R. Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons, in: Proc. 2nd Annual ACM Symposium on Computational Geometry, 1986, pp. 1-12.
18. L. Guibas, R. Motwani, P. Raghavan, The robot localization problem in two dimensions, SI AM J. Comput. 26 (4) (1997) 1120-1138.
19. J. Hershberger, An optimal visibility graph algorithm of triangulated simple polygons, Algorithmica 4 (1989) 141-155.
20. J. Hershberger, S. Suri, A pedestrian approach to ray shooting: shoot a ray take a walk, in: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 54-63.
21. B. Joe, R.B. Simpson, Corrections to Lee's visibility polygon algorithm, BIT 27 (1986) 458-73.
22. D. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput. 12 (1) (1983) 28-35.
23. D.T. Lee, Visibility of a simple polygon, Computer Vision, Graphics, and Image Processing 22 (1983) 207-221.
24. D.T. Lee, A.K. Lin, Computing the visibility polygon from an edge, Computer Vision, Graphics, and Image Processing 34 (1986) 1-19.
25. D.T. Lee, P.P. Preparata, Location of a point in a planar subdivision and its applications, SIAM J. Comput. 6 (3) (1977) 594-606.
26. K. Mehlhorn, Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, New York, 1984.
27. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
28. P.P. Preparata, A new approach to planar point location, SIAM J. Comput. 10 (3) (1981) 473-82.
29. P.P. Preparata, M.I. Shamos, Computational Geometry, an Introduction, Springer-Verlag, New York, 1985.
30. N. Sarnak, R. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (7) (1986) 669-679.
31. T.C. Shermer, Visibility properties of polygons, Ph.D. Thesis, McGill University, 1989.
32. T.C. Shermer, Recent results in art galleries, Proc. IEEE 80 (9) (1992) 1384-1399.
33. G.T. Toussaint, Computational Geometry, Elsevier Science, Amsterdam, 1985.