Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

Journal of Algorithms

Volumn 20, Issue 3, 1996, Pages 459-478

  Chen, Danny Z ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINE SEGMENT; OPTIMAL ALGORITHM; POLYGON; SEQUENTIAL ALGORITHM; SHORTEST PATH;

PARALLEL ALGORITHMS;

EID: 0030367229     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0023     Document Type: Article

References (25)

1. D. Avis and G. T. Toussaint, An optimal algorithm for determining the visibility polygon from an edge, IEEE Trans. Comput. C-30 (12) (1981), 910-914.
2. B. K. Bhattacharya, D. G. Kirkpatrick, and G. T. Toussaint, Determining sector visibility of a polygon, in "Proceedings 5th Annual ACM Symposium Computational Geometry, 1989," pp. 247-254.
3. B. K. Bhattacharya, A. Mukhopadhyay, and G. T. Toussaint, A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible, in "Proceedings Workshop on Algorithms and Data Structures (WADS'91), 1991, Ottawa, Canada," pp. 412-424.
4. B. Chazelle and L. J. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551-581.
5. D. Z. Chen, Parallel techniques for paths, visibility, and related problems, Ph.D. thesis, Technical Report 92-051, Department of Computer Sciences, Purdue University, July 1992.
6. D. Z. Chen, An optimal parallel algorithm for detecting weak visibility of a simple polygon, "Proceedings of the Eighth Annual ACM Symposium on Computational Geometry, 1992," pp. 63-72. Internat. J. Comput. Geom. Appl. 5, Nos. 1 & 2 (1995), 93-124.
7. D. Z. Chen, An optimal parallel algorithm for detecting weak visibility of a simple polygon, "Proceedings of the Eighth Annual ACM Symposium on Computational Geometry, 1992," pp. 63-72. Internat. J. Comput. Geom. Appl. 5, Nos. 1 & 2 (1995), 93-124.
8. D. Z. Chen, Determining weak external visibility of polygons in parallel, in "Proceedings 6th Canadian Conference on Computational Geometry, Saskatoon, Canada, 1994," pp. 375-380.
9. Y. T. Ching, M. T. Ko, and H. Y. Tu, On the cruising guard problems, Technical Report, 1989, Institute of Information Science, Academia Sinica, Taipei, Taiwan.
10. J. I. Doh and K. Y. Chwa, An algorithm for determining visibility of a simple polygon from an internal line segment, J. Algorithms 14 (1993), 139-168.
11. H. ElGindy, Hierarchical decomposition of polygon with applications, Ph.D. thesis, McGill University, 1985.
12. S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. V. Madhavan, Characterizing weak visibility polygons and related problems, Technical Report IISc-CSA-90-1, 1990, Department of Computer Science and Automation, Indian Institute of Science.
13. M. T. Goodrich, S. B. Shauck, and S. Guha, Parallel methods for visibility and shortest path problems in simple polygons (preliminary version), "Proceedings 6th Annual ACM Symposium Computational Geometry, 1990," pp. 73-82.
14. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, Linear time algorithms for visibility and shortest paths problems inside triangulated simple polygons, Algorithmica 2 (1987), 209-233.
15. P. J. Heffernan and J. S. B. Mitchell, Structured visibility profiles with applications to problems in simple polygons," in "Proceedings 6th Annual ACM Symposium Computational Geometry, 1990," pp. 53-62.
16. J. Hershberger, Optimal parallel algorithms for triangulated simple polygons, in "Proceedings 8th Annual ACM Symposium Computational Geometry, 1992," pp. 33-42.
17. Y. Ke, Detecting the weak visibility of a simple polygon and related problems, manuscript, Department of Computer Science, Johns Hopkins University, 1988.
18. C. P. Kruskal, L. Rudolph, and M. Snir, The power of parallel prefix, IEEE Trans. Comput. C-34 (1985), 965-968.
19. R. E. Ladner and M. J. Fischer, Parallel prefix computation, J. Assoc. Comput. Mach. 27 (4) (1980), 831-838.
20. D. T. Lee and A. K. Lin, Computing the visibility polygon from an edge, Comput. Vision Graphics Image Process. 34 (1986), 1-19.
21. S. H. Lee and K. Y. Chwa, Some chain visibility problems in a simple polygon, Algorithmica 5 (1990), 485-507.
22. J.-R. Sack and S. Suri, An optimal algorithm for detecting weak visibility of a polygon, IEEE Trans. Comput. C-39 (10) (1990), 1213-1219.
23. S. Y. Shin, Visibility in the plane and its related problems, Ph.D. thesis, University of Michigan, 1986.
24. G. T. Toussaint, A linear-time algorithm for solving the strong hidden-line problem in a simple polygon, Pattern Recognit. Lett. 4 (1986), 449-451.
25. G. T. Toussaint and D. Avis, On a convex hull algorithm for polygons and its applications to triangulation problems, Pattern Recognit. 15 (1) (1982), 23-29.