A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of 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
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Cutting hyperplane arrangements
Discrete & Computational Geometry
Journal of Symbolic Computation
A class of convex programs with applications to computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Hi-index | 0.00 |