Abstract
We present a parallel algorithm for finding the convex hull of a sorted set of points in the plane. Our algorithm runs inO(logn/log logn) time usingO(n log logn/logn) processors in theCommon crcw pram computational model, which is shown to be time and cost optimal. The algorithm is based onn 1/3 divide-and-conquer and uses a simple pointer-based data structure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap:Parallel computational geometry. Algorithmica, 3: 293–327, 1988.
M. J. Atallah and D. C. Chen:An optimal parallel algorithm for the visibility of a simple polygon from a point. In Proc. of the Fifth Annual ACM Symposium on Computational Geometry, pp. 114–123, 1989.
M. J. Atallah and M. T. Goodrich:Efficient parallel solutions to some geometric problems. Journal of Parallel and Distributed Computing, 3: 492–507, 1986.
M. J. Atallah and M. T. Goodrich:Parallel algorithms for some functions of two convex polygons. Algorithmica, 3, 535–548, 1988.
P. Beame and J. Håstad:Optimal bounds for decision problems on the. Journal of the ACM, 36, 643–670, 1989.
M. Ben-Or:Lower bounds for algebraic computation trees. In Proc. 15th Annual ACM Symposium on Theory of Computing, pp. 80–86, 1983.
R. Cole and M. T. Goodrich:Optimal parallel algorithms for polygon and point set problems. In Proc. of the Fourth Annual ACM Symposium on Computational Geometry, 1988.
R. Cole and U. Vishkin;Faster optimal parallel prefix sums and list ranking. Information and Computation, 81, 334–352, 1989.
M. T. Goodrich:Finding the convex hull of a sorted point set in parallel. Information Processing Letters, 26, 173–179, 1987.
R. L. Graham:An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1: 132–133, 1972.
F. P. Preparata and M. L. Shamos:Computational Geometry: An Introduction. Springer-Verlag, 1985.
Y. Shiloach and U. Vishkin:Finding the maximum, merging, and sorting in a parallel computational model. Journal of Algorithms, 12, 88–102, 1981.
Author information
Authors and Affiliations
Additional information
Part of this work was done when the last three authors were at the Department of Computer and Information Science, Linköping University. The research of the second author was supported by the Academy of Finland.
Rights and permissions
About this article
Cite this article
Fjällström, PO., Katajainen, J., Levcopoulos, C. et al. A sublogarithmic convex hull algorithm. BIT 30, 378–384 (1990). https://doi.org/10.1007/BF01931655
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931655