Robust gift wrapping for the three-dimensional convex hull
- 31 October 1994
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 49 (2) , 391-407
- https://doi.org/10.1016/s0022-0000(05)80056-x
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology (04452191, 05555027)
This publication has 17 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- A paradigm for robust geometric algorithmsAlgorithmica, 1992
- Construction of the Voronoi diagram for 'one million' generators in single-precision arithmeticProceedings of the IEEE, 1992
- Verifiable implementations of geometric algorithms using finite precision arithmeticArtificial Intelligence, 1988
- Computational Geometry--An Introduction.Mathematics of Computation, 1986
- Finding the convex hull facet by facetJournal of Algorithms, 1985
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- 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