Fixed-radius near neighbors search algorithms for points and segments
Information Processing Letters
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
New techniques for computing order statistics in Euclidean space (extended abstract)
SCG '85 Proceedings of the first annual symposium on Computational geometry
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
| Hi-index | 0.00 |