A fast algorithm for particle simulations
Journal of Computational Physics
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
New techniques for exact and approximate dynamic closest-point problems
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Parallel Construction of Quadtrees and Quality Triangulations
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Deformable spanners and applications
Computational Geometry: Theory and Applications
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Deformable spanners and applications
Computational Geometry: Theory and Applications
A template for developing next generation parallel Delaunay refinement methods
Finite Elements in Analysis and Design
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Balanced aspect ratio trees revisited
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A massively parallel adaptive fast multipole method on heterogeneous architectures
Communications of the ACM
Quality and efficiency for kernel density estimates in large data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.02 |