Abstract
A chord of a simple polygon P is weakly-visible if every point on P is visible from some point on the chord. We give an optimal linear-time algorithm which computes all weakly-visible chords of a simple polygon P with n vertices.
Supported in part by NSF Grant CCR-930-6822
Supported in part by NSF Grant INT-911-5870
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Transactions on Computers 30 (1981) 910–914
Chen, D.Z.: Optimally computing the shortest weakly-visible edge of a simple polygon. Proc. Fourth ISAAC, LNCS 762 (1993) 323–332
Doh, J., Chwa, K.: An algorithm for determining visibility of a simple polygon from an Internal Line Segment. J. of Algorithms 14(1) (1993) 139–168
Das, D., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Proc. 5th Canadian Conference on Computational Geometry (1993) 303–308. Submitted to special issue of Computational Geometry — Theory and Appln.
Das, G., Narasimhan, G.: Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Proc. 10th Annual ACM Symp. on Computational Geometry (1994)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2 (1987) 209–233
Heffernan, P.J.: An optimal algorithm for the two-guard problem. Proc. 9th Annual ACM Symp. on Computational Geometry (1993) 348–358
Icking, C., Klein, R.: The two guards problem. Proc. 7th Annual ACM Symp. on Computational Geometry (1991) 166–175
Ke, Y.: Detecting the weak visibility of a simple polygon and related problems. Tech. Report, The Johns Hopkins University (1987)
Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26(3) (1979) 415–421
Sack, J.-R., Suri, S.: An optimal algorithm for detecting weak visibility. IEEE Transactions on Computers 39(10) (1990) 1213–1219
Tseng, L.H., Lee, D.T.: Two-guard walkability of simple polygons. manuscript (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, G., Heffernan, P.J., Narasimhan, G. (1994). Finding all weakly-visible chords of a polygon in linear time. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-58218-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58218-2
Online ISBN: 978-3-540-48577-3
eBook Packages: Springer Book Archive