Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Oriented projective geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Degenerate convex hulls in high dimensions without extra storage
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Algorithms
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Ray shooting and parametric search
SIAM Journal on Computing
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
A Lower Bound to Finding Convex Hulls
Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
| Hi-index | 0.00 |