Abstract
In this paper we present a linear time algorithm for finding the convex hull of a simple polygon. Compared to the result of McCallum and Avis, our algorithm requires only one stack, instead of two, and runs more efficiently.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. G. Akl and G. T. Toussaint, “A fast convex hull algorithm,”Info. Proc. Lett.,7:219–222 (1978).
A. M. Andrew, “Another efficient algorithm for convex hull in 2-dimensions,”Info. Proc. Lett.,9:216–219 (1979).
D. Avis, “On the complexity of finding the convex hull of a set of points,” Tech. Rep., SOCS 79.2, School of Computer Science, McGill University, (1979).
A. Bykat, “Convex hull of a finite set of points in two dimensions,”Info. Proc. Lett.,7:296–298 (1978).
W. E. Eddy, “A new convew hull algorithm for planar sets,”A CM Trans. Math. Software,3:398–403 (1977).
R. L. Graham, “An efficient algorithm for determining the convex hull of a finite planar set,”Info. Proc. Lett. 1:132–133 (1972).
R. L. Graham and F. F. Yao, “Finding the convex hull of a simple polygon,”J. Algorithms (to appear).
D. T. Lee and F. P. Preparata, “The all nearest neighbor problem for convex polygons,”Info. Proc. Lett.,7:189–192 (1978).
D. McCallum and D. Avis, “A linear time algorithm for finding the convex hull of a simple polygon,”Info. Proc. Leu.,9:201–205 (1979).
J. O'Rourke and G. T. Toussaint, private communication.
F. P. Preparata, “An optimal real time algorithm for planar convex hulls,”Comm. ACM. 22:402–405 (1979).
F. P. Preparata and S. J. Hong, “Convex hulls of finite sets of points in two and three dimensions,”Comm. ACM,20:87–93 (1977).
M. I. Shamos, “Problems in computational geometry,” Department of Computer Science, Yale University (1975 and 1977).
J. Sklansky, “Measuring concavity on a rectangular mosaic,”IEEE Trans. Comput.,C-21:1355–1364 (1972).
J. Sklansky, “Finding the convex hull of a simple polygon,”Pattern Recognition Lett.,1:79–83 (1982).
G. T. Toussaint and H. El Gindy, “An counterexample to an algorithm for computing monotone hulls of simple polygons,” Tech. Rep. SOCS 83.1, School of Computer Science, McGill University (1983).
Author information
Authors and Affiliations
Additional information
Supported in part by the National Science Foundation under Grants MCS 7916847 and MCS 8202359.
Rights and permissions
About this article
Cite this article
Lee, D.T. On finding the convex hull of a simple polygon. International Journal of Computer and Information Sciences 12, 87–98 (1983). https://doi.org/10.1007/BF00993195
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00993195