Computing
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Output sensitive construction of levels and Voronoi diagrams in Rd of order 1 to k
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Finding k points with minimum diameter and related problems
Journal of Algorithms
New upper bounds in Klee's measure problem
SIAM Journal on Computing
An optimal convex hull algorithm and new results on cuttings (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
New algorithms for minimum area k-gons
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Discrete & Computational Geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Anatomy of a Geometric Algorithm
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
| Hi-index | 0.01 |