Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Linear programming in O(n × 3d2) time
Information Processing Letters
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
On k-hulls and related problems
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Solving related two- and three-dimensional linear programming problems in logarithmic time
Theoretical Computer Science
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth 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
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Randomized multidimensional search trees: lazy balancing and dynamic shuffling (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reporting points in halfspaces
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic three-dimensional linear programming
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
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Algorithms
Using separation algorithms in fixed dimension
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Dynamic Half-Space Range Reporting and Its Application
Dynamic Half-Space Range Reporting and Its Application
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Three-dimensional alpha shapes
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient algorithms for the minimum diameter bridge problem
Computational Geometry: Theory and Applications - Special issue on Discrete and computational geometry
Efficient Algorithms for the Minimum Diameter Bridge Problem
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
Journal of Parallel and Distributed Computing
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the twenty-sixth annual symposium on Computational geometry
Indexing for vector projections
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Polyline fitting of planar points under min-sum criteria
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
A new approach to output-sensitive voronoi diagrams and delaunay triangulations
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |