A simple algorithm for building the 3-D convex hull
- 1 June 1983
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 23 (2) , 145-160
- https://doi.org/10.1007/bf02218436
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- 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 the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973
- An Algorithm for Convex PolytopesJournal of the ACM, 1970