Computing a shortest weakly externally visible line segment for a simple polygon

International Journal of Computational Geometry and Applications

Volumn 9, Issue 1, 1999, Pages 81-96

  Bhattacharya, Binay K ^a   Mukhopadhyay, Asish ^b   Toussaint, Godfried T ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

External visibility; Polygon; Shortest visible line segment; Weak visibility

Indexed keywords

EID: 0033484876     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000078     Document Type: Article

References (17)

1. M. Atallah and C. Bajaj, "Efficient algorithms for common transversals," Information Processing Letters, 25:87-91, 1987.
2. D. Avis and G. T. Toussaint, "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Transactions on Computers, C-30:910-914, 1981.
3. D. Avis and R. Wenger, "Algorithms for line stabbers in space," In Proc. of the Third Annual ACM Symp. on Computational Geometry, pages 300-307, 1987.
4. B. K. Bhattacharya, J. Czysowicz, P. Egyed, G. T. Toussaint, I. Stojmenovic and J. Urrutia, "Computing shortest transversals of sets," In Proc. of the Seventh Annual ACM Symp. on Computational Geometry, pp. 71-80, 1991.
5. B. K. Bhattacharya, D. Kirkpatrick and G. T. Toussaint, "Determining sector visibility of a polygon," In Proc. of the Fifth Annual ACM Symp. on Computational Geometry, pp. 247-254, 1989.
6. B. K. Bhattacharya and A. Mukhopadhyay, "Computing in linear time a chord from which a polygon is weakly internally visible," In Proc. of 6th Annual International Symposium on Algorithms and Computations, Lecture Notes in Computer Science, No. 1004, pp. 22-31, 1995.
7. 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 Workshop on algorithms and data structures, pp. 412-424, 1991.
8. B. K. Bhattacharya and G. T. Toussaint, "Computing shortest transversals," Computing, 46:93-119, 1991.
9. D. Z. Chen, "Determining weak external visibility of polygons in parallel," In Proc. of the Sixth Canadian Conference on Computational Geometry (CCCG), Saskatoon, Canada, 1994, pp. 375-380.
10. G. Das and G. Narasimhan, "Optimal linear-time algorithm for the shortest illuminating line segment in a polygon," In Proc. of the Tenth Annual Symp. on Computational Geometry, pages 259-266, 1994.
11. D. Dobkin, L. Guibas, J. Hershberger and J. Snoeyink, "An efficient algorithm for finding the CSG representative of a simple polygon," Computer Graphics, 22:31:40, 1988.
12. J. Doh and K. Chawa, "An algorithm for determining internal line visibility of a simple polygon," J. of Algorithms, 14:139-168, 1993.
13. H. Edelsbrunner, "Finding transversals for sets of simple geometric figures," Theoretical Computer Science, 35:55-69, 1985.
14. B. Grünbaum, "On common transversals," Arch. Math., 9:465-469, 1958.
15. M. Keil, "A simple algorithm for determining the envelope of a set of lines," Information Processing Letters 39:121:124, 1991.
16. T. Lewis, "Two counter-examples concerning transversals for convex subsets of the plane," Geometriae Dedicata, 9:461:465, 1980.
17. F. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer Verlag, 1985.