Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A randomized algorithm for closest-point queries
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
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of Algorithms
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
Approximations and optimal geometric divide-and-conquer
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
Journal of Algorithms
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Near-Linear Time Approximation Algorithms for Curve Simplification
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Polytope approximation and the Mahler volume
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Enumerating a subset of the integer points inside a Minkowski sum
Computational Geometry: Theory and Applications
Hi-index | 0.00 |