Epsilon-nets and simplex range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Partition trees for triangle counting and other range searching problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Quasi-Valid range querying and its implications for nearest neighbor problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Good splitters for counting points in triangles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth 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
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Intersection queries for curved objects (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Computational Geometry: Theory and Applications
Two-dimensional range search based on the Voronoi diagram
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Proceedings of the twenty-sixth annual symposium on Computational geometry
Tight lower bounds for halfspace range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry
A real elementary approach to the master recurrence and generalizations
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
| Hi-index | 0.89 |