Abstract
In 1981, Avis and Toussaint gave a linear-time algorithm for the following problem: Given a simple n-vertex polygon P and an edge of P, determine whether each point in P can be seen by some (not necessarily the same) point on the edge. They posed the more general problem of finding a sub-quadratic algorithm for determining whether such an edge exists. In this paper, we present a linear-time algorithm for determining all (if any) such edges of a given simple polygon.
This work was done while the second author was with Johns Hopkins University and visited Carleton University.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Avis D. and G.T. Toussaint, "An optimal algorithm for determining the visibility polygon from an edge", IEEE Transaction on Computers, Vol. C-30, No. 12, pp. 910–914 (1981).
Chazelle B. and L.J. Guibas, "Visibility and intersection problems in plane geometry", Proc. First ACM Symposium on Computational Geometry, pp. 135–146 (1985).
ElGindy H. and D. Avis, "A linear algorithm for computing the visibility polygon from a point", Journal of Algorithms, 2, pp. 186–197 (1981).
Guibas, L., J.Hershberger, D.Leven, M. Sharir, and R. Tarjan, "Linear-time algorithms for visibility and shortest path problems inside a triangulated simple polygon", Tech. Rept. 218, Computer Science Dept., Courant Institute (1986).
Lee D.T., "Visibility if a simple polygon", Computer Vision, Graphics and Image Processing, 22, pp. 207–221 (1983).
Lee D.T. and F. Preparata, "An optimal algorithm for finding the kernel of a polygon", Journal of the ACM, 26, pp. 415–421 (1979).
O'Rourke J, Art-Gallery Theorems and Algorithms, Oxford University Press (1987).
Sack J.-R. "Rectilinear computational geometry", Tech. Rept. SCS-TR54, School of Computer Science, Carleton University (1984).
Sack J.-R. and G.T. Toussaint, "Translating Polygons in the Plane", Proc. STACS 1985, Lecture Notes in Computer Science 182, Springer, Berlin Heidelberg New York Tokyo, 1985, pp. 310–321.
Suri, S., "A polygon partitioning technique for link distance problems", Ph.D. Thesis, Dept. of Computer Science, Johns Hopkins University (1987).
Toussaint G.T. and D. Avis, "On a convex hull algorithm for polygons and its applications to triangulation problems", Pattern Recognition, Vol. 15, No. 1, pp. 23–29 (1982).
Tarjan R. and C. Van Wyk, "An O(n loglog n) algorithm for triangulating simple polygons," preprint (submitted to SIAM J. Computing) (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sack, JR., Suri, S. (1988). An optimal algorithm for detecting weak visibility of a polygon. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035855
Download citation
DOI: https://doi.org/10.1007/BFb0035855
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive