Constructing the convex hull of a partially sorted set of points
- 31 March 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 2 (5) , 267-278
- https://doi.org/10.1016/0925-7721(93)90023-y
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull ProblemSIAM Journal on Computing, 1991
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Parallel computational geometryAlgorithmica, 1988
- Finding the convex hull of a sorted point set in parallelInformation Processing Letters, 1987
- Efficient parallel solutions to some geometric problemsJournal of Parallel and Distributed Computing, 1986
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- On the convex layers of a planar setIEEE Transactions on Information Theory, 1985
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983