Characterizing LR-visibility polygons and related problems

Computational Geometry: Theory and Applications

Volumn 18, Issue 1, 2001, Pages 19-36

  Bhattacharya, Binay K ^a   Ghosh, Subir Kumar ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Euclidean shortest path; Merging; Shortest path tree; Visibility

Indexed keywords

EID: 0346526168     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00024-9     Document Type: Article

References (17)

1. Asano T., Ghosh S.K., Shermer T.C. Visibility in the plane. Sack J.-R., Urrutia J. Handbook in Computational Geometry. 1999, Chapter 19;829-876 Elsevier Science.
2. Avis D., Toussaint G.T. An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. C-30:1981;910-914.
3. Chazelle B. Triangulating a simple polygon in linear time, Technical Report No. CS-TR-264-90. 1990;Department of Computer Science, Princeton University.
4. Chazelle B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6:1991;485-529.
5. Chen D. Optimally computing the shortest weakly visible subedge of a simple polygon. Proceedings of the 4th International Symposium on Algorithms and Computation. 1993;323-332.
6. Das G., Heffernan P.J., Narasimhan G. Finding all weakly-visible chords of a polygon in linear time. Scandinavian Workshop on Algorithm Theory. 1994;119-130.
7. Das G., Heffernan P.J., Narasimhan G. LR-visibility in polygons. Computational Geometry. 7:1997;37-57.
8. Doh J., Chwa K. An algorithm for determining internal line visibility of a simple polygon. J. Algorithms. 14:1993;139-168.
9. Ghosh S.K., Maheshwari A., Pal S.P., Saluja S., Veni Madhavan C.E. Computing the shortest path tree in a weak visibility polygon. Proceedings of the 11th Symposium on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. 560:1991;369-389 Springer, Berlin.
10. Ghosh S.K., Maheshwari A., Pal S.P., Saluja S., Veni Madhavan C.E. Characterizing and recognizing weak visibility polygons. Computational Geometry. 3:1993;213-233.
11. Guibas L., Hershberger J., Leven D., Sharir M., Tarjan R. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica. 2:1987;209-233.
12. Heffernan P.J. An optimal algorithm for the two-guard problems. Proceedings of the ACM Symposium on Computational Geometry. 1993;139-168.
13. Hershberger J. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica. 4:1989;141-155.
14. Kim S.-H., Shin S.Y., Chwa K.-Y. Efficient algorithms for solving diagonal visibility problems in a simple polygon. Internat. J. Comput. Geom. Appl. 5:1995;433-458.
15. Lee D.T. Visibility of a simple polygon. Comput. Vision Graphics Image Process. 22:1983;207-221.
16. Pal S.P. Weak visibility and related problems on simple polygons. Ph.D. Thesis. September 1990;Department of Computer Science and Automation, Indian Institute of Science, India.
17. Tseng L.H., Heffernan P., Lee D.T. Two-guard walkability of simple polygons. Internat. J. Comput. Geom. Appl. 8:1998;85-116.