Optimal output-sensitive convex hull algorithms in two and three dimensions
- 1 April 1996
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 16 (4) , 361-368
- https://doi.org/10.1007/bf02712873
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Derandomizing an output-sensitive convex hull algorithm in three dimensionsComputational Geometry, 1995
- An Optimal Algorithm for Intersecting Three-Dimensional Convex PolyhedraSIAM Journal on Computing, 1992
- Ray shooting in polygons using geodesic triangulationsPublished by Springer Nature ,1991
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Intersection of convex objects in two and three dimensionsJournal of the ACM, 1987
- Computational GeometryPublished by Springer Nature ,1985
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- An Algorithm for Convex PolytopesJournal of the ACM, 1970