The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Halfplanar range search in linear space and O(n0.695) query time
Information Processing Letters
Halfspace range search: an algorithmic application of k-sets
Discrete & Computational Geometry
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Partitioning arrangements of lines, part I: an efficient deterministic algorithm
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Cutting hyperplane arrangements
SCG '90 Proceedings of the sixth 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
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Design of Dynamic Data Structures
Design of Dynamic Data Structures
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
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
Incidence and nearest-neighbor problems for lines in 3-space
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computing and verifying depth orders
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Determining the castability of simple polyhedra
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
| Hi-index | 0.00 |