Finding the convex hull of a sorted point set in parallel
- 4 December 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (4) , 173-179
- https://doi.org/10.1016/0020-0190(87)90002-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Efficient parallel solutions to some geometric problemsJournal of Parallel and Distributed Computing, 1986
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- Computational Geometry on a Systolic ChipIEEE Transactions on Computers, 1984
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- An optimal real-time algorithm for planar convex hullsCommunications of the ACM, 1979
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977