Abstract
Two points in a simple polygon are said to be convex visible if the Euclidean shortest path between them makes either only right turns or only left turns. We propose an O(n 2 log n) time algorithm for finding a line segment inside a simple polygon (if there exists one) such that every point in the polygon is convex visible from some point of the line segment. We propose an O(n 3) time algorithm for finding the maximum independent set of the convex visibility graph for a restricted class of simple polygons.
This author's work is supported partly by a Rajiv Gandhi Research Grant from the Jawaharlal Nehru Centre for Advanced Scientific Research, Bangalore, and The Rajiv Gandhi Foundation
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Biswas, Chithra Prasad, and Sudebkumar Prasant Pal. Algorithms for convex visibility problems. Manuscript, 1994.
Goutam Das and Giri Narasimhan. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon. In Proceedings of the ACM Symposium on Computational Geometry, 1994.
Jeong-In Doh and Kyung-Yong Chwa. An algorithm for determining visibility of a simple polygon from an internal line segment. Journal of Algorithms, 14: 139–168, 1993.
H. Everett. Visibility graph recognition. PhD thesis, University of Toronto, Technical Report 231/90, 1990.
S. K. Ghosh. Problems in computational geometry. PhD thesis, University of Bombay, 1987.
S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. Veni Madhavan. An algorithm for recognizing palm polygons. In Proceedings of the Second Canadian Conference in Computational Geometry (also to appear in The Visual Computer, Springer-Verlag), 1990.
S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. Veni Madhavan. Characterizing and recognizing weak visibility polygons. Computational Geometry: Theory and Applications, 3: 213–233, 1993.
L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2: 209–233, 1987.
Y. Ke. Detecting the weak visibility of a simple polygon and related problems. Technical report, Johns Hopkins University, JHU-88/17, 1988.
T. Shermer. Hiding people in polygons. Computing, 42: 109–132, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biswas, S., Prasad, D.C., Pal, S.P. (1994). Algorithms for convex visibility problems. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_124
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_124
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive