Optimally computing a shortest weakly visible line segment inside a simple polygon

Computational Geometry: Theory and Applications

Volumn 23, Issue 1, 2002, Pages 1-29

  Bhattacharya, Binay K ^a   Das, Gautam ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750728475     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00058-X     Document Type: Article

References (29)

1. L.G. Aleksandrov, H.N. Djidjev, J.-R. Sack, An O(;i logn) algorithm for finding a shortest central link segment, Internat. J. Comput. Geom. Appl. 10 (2) (2000) 157-188.
2. D. Avis, G.T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput. 30(1981)910-914.
3. B.K. Bhattacharya, A. Mukhopadhyay, Computing in linear time an internal line segment from which a simple polygon is weakly internally visible, in: Proc. International Symposium on Algorithms and Computation, Cairns, Australia, 1995, pp. 22-31.
4. B.K. Bhattacharya, A. Mukhopadhyay, G.T. Toussaint, Computing a shortest weakly externally visible line segment for a simple polygon, Internat. J. Comput. Geom. Appl. 9 (1999) 81-96.
5. E. Buchman, F.A. Valentine, External visibility, Pacific J. Math. 64 (1976) 333-340.
6. S. Carlsson, H. Jonsson, Computing a shortest watchman path in a simple polygon in polynomial-time, in: S. Akl, F. Dehne, J.R. Sack, N. Santoro (Eds.), Algorithms and Data Structures: Proc. Fourth WADS, Lecture Notes in Computer Science, Vol. 955, 1995, pp. 122-134.
7. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1991) 485-524.
8. D.Z. Chen, Optimally computing the shortest weakly visible subedge of a simple polygon, J. Algorithms 20 (3) (1996) 459-478.
9. W.P. Chin, S. Ntafos, Shortest watchman routes in simple polygons, Discrete Comput. Geom. 6 (1991) 9-31.
10. G. Das, P. Heffeman, G. Narasimhan, LR-visibility in polygons, Computational Geometry 7 (1997) 37-57.
11. G. Das, P.J. Heffernan, G. Narasimhan, Finding all weakly-visible chords of a polygon in linear time, Nordic J. Comput. 1 (1994) 433-456.
12. G. Das, G. Narasimhan, Optimal linear-time algorithm for the shortest illuminating line segment in a polygon, in: Proc. 10th Annual ACM Symp. on Computational Geometry, 1994, pp. 259-268.
13. H.N. Djidjev, A. Lingas, J.-R. Sack, An O(nlogn) algorithm for computing the link center of a simple polygon, Discrete Comput. Geom. 8 (1992) 131-152.
14. J. Doh, K. Chwa, An algorithm for determining internal line visibility of a simple polygon, J. Algorithms 14 (1993) 139-168.
15. H. El Gindy, D. Avis, A linear algorithm for computing the visibility polygon from a point, J. Algorithms 2 (1981) 186-197.
16. L. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. Tarjan, Linear time algorithms for visibility and shortest path problems inside a triangulated simple polygon, Algorithmica 2 (1987) 209-233.
17. C. Icking, R. Klein, The two guards problem, Internat. J. Comput. Geom. Appl. 2 (3) (1992) 257-285.
18. Y. Ke, Detecting the weak visibility of a simple polygon and related problems, Technical Report, The Johns Hopkins University, 1987.
19. Y. Ke, An efficient algorithm for link-distance problems, in: Proc. 5th Annu. ACM Sympos. Comput. Geom., 1989, pp. 69-78.
20. M. Keil, A simple algorithm for determining the envelope of a set of lines, Inform. Process. Lett. 39 (1991) 121-124.
21. P. Pradeep Kumar, C.E. Veni Madhavan, Shortest watchman tours in weak visibility polygons, in: Proc. 5th Canadian Conference on Computational Geometry, 1993, pp. 91-96.
22. D.T. Lee, P.P. Preparata, An optimal algorithm for finding the kernel of a polygon, JACM 26 (1979) 415-421.
23. S. Ntafos, Watchman routes under limited visibility, Computational Geometry 1 (1991) 149-170.
24. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987.
25. J. O'Rourke, Computational geometry column 18, SIGACT News 24 (1993) 20-25.
26. J.R. Sack, S. Suri, An optimal algorithm for detecting weak visibility, IEEE Trans. Comput. 39 (1990) 1213-1219.
27. N. Samak, R. Tarjan, Planar point location using persistent search trees, CACM 29 (1986) 669-679.
28. L.H. Tseng, P. Heffernan, D.T. Lee, Two-guard walkability of simple polygons, Internat. J. Comput. Geom. Appl. 8 (1) (1998) 85-116.
29. F.A. Valentine, Minimal sets of visibility, Proc. Amer. Math. Soc. 4 (1953) 917-921.