The Ultimate Planar Convex Hull Algorithm?
- 1 February 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (1) , 287-299
- https://doi.org/10.1137/0215021
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Linear-time algorithms for linear programming in R3 and related problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- On the Ω(n log n) lower bound for convex hull and maximal vector determinationInformation Processing Letters, 1980
- An optimal real-time algorithm for planar convex hullsCommunications of the ACM, 1979
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973