Output-sensitive results on convex hulls, extreme points, and related problems
- 1 April 1996
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 16 (4) , 369-387
- https://doi.org/10.1007/bf02712874
Abstract
No abstract availableThis publication has 41 references indexed in Scilit:
- Derandomizing an output-sensitive convex hull algorithm in three dimensionsComputational Geometry, 1995
- Enumerating extreme points in higher dimensionsPublished by Springer Nature ,1995
- On the detection of a common intersection of κ convex polyhedraPublished by Springer Nature ,1988
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Computational GeometryPublished by Springer Nature ,1985
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- An Algorithm for Convex PolytopesJournal of the ACM, 1970