Abstract
A simple polygon P is said to be weakly externally visible from a line segment if the line segment is outside P and if for every point x on the boundary of P there is a point y on the line segment such that the interior of the line segment xy does not intersect the interior of P. In this paper a linear time algorithm is proposed for computing the shortest line segment from which a simple polygon is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Atallah, M. and Bajaj, C., "Efficient algorithms for common transversals," Information Processing Letters, Vol. 25, pp.87–91, 1987.
Avis, D. and Toussaint, G.T., "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Transaction on Computers, Vol. C-30, No. 12, 1981, pp. 910–914.
Avis, D. and Wenger, R., "Algorithms for line stabbers in space," Proc. 3rd ACM Symposium on Computational Geometry, pp.300–307, 1987.
Bhattacharya, B., Czysowicz, J., Egyed, P., Toussaint, G., Stojmenovic, I. and Urrutia, J., "Computing shortest transversals of sets," Forthcoming Proc. 7th ACM Symposium on Computational Geometry, 1991.
Bhattacharya, B.K., Kirkpatrick, D. and Toussaint, G.T., "Determining sector visibility of a polygon," Proc. 5th ACM Symposium on Computational Geometry, pp.247–254, 1989.
Bhattacharyya, B.K. and Toussaint, G.T., "Computing shortest transversals," Tech. Report SOCS 90.6, McGill University, April 1990.
Edelsbrunner, H., "Finding transversals for sets of simple geometric figures," Theoretical Computer Science, Vol.35, pp.55–69, 1985.
Grunbaum, B., "On common transversals," Arch. Math., Vol.9, pp. 465–469, 1958.
Ke, Yan, "Detecting the weak visibility of a simple polygon and related problems," John Hopkins University, manuscript, 1988.
Lewis, T., "Two counter-examples concerning transversals for convex subsets of the plane," Geometriae Dedicata, Vol.9, pp. 461–465, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharya, B.K., Mukhopadhyay, A., Toussaint, G.T. (1991). A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028280
Download citation
DOI: https://doi.org/10.1007/BFb0028280
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54343-5
Online ISBN: 978-3-540-47566-8
eBook Packages: Springer Book Archive