Planar point location using persistent search trees
Communications of the ACM
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
On the detection of a common intersection of k convex polyhedra
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
On the detection of a common intersection of k convex objects in the plane
Information Processing Letters
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
A class of convex programs with applications to computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Circular separability of polygon
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth 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)
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Two-Center Problems for a Convex Polygon (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
| Hi-index | 0.00 |