Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
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
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Note: Computing closest and farthest points for a query segment
Theoretical Computer Science
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |