The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Epsilon-nets and simplex range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
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
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
A 3-space partition and its applications
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds on the complexity of multidimensional searching
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |