The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Computational geometry: an introduction
Computational geometry: an introduction
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Algorithms
Reporting points in halfspaces
Computational Geometry: Theory and Applications
On vertical ray shooting in arrangements
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Ray shooting and parametric search
SIAM Journal on Computing
Computing and Verifying Depth Orders
SIAM Journal on Computing
Point location among hyperplanes and unidirectional ray-shooting
Computational Geometry: Theory and Applications
ACM Computing Surveys (CSUR)
Simplex range reporting on a pointer machine
Computational Geometry: Theory and Applications
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Range Searching
New lower bounds for halfspace emptiness
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficiently approximating polygonal paths in three and higher dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
| Hi-index | 0.00 |