A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)

Authors:
Paul B. Callahan;S. Rao Kosaraju
Affiliations:
Computer Science Department, Johns Hopkins University, Baltimore, MD;Computer Science Department, Johns Hopkins University, Baltimore, MD
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 9
Cited 26

Computational geometry: an introduction

Computational geometry: an introduction
A fast algorithm for particle simulations

Journal of Computational Physics
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)

VLSI Algorithms and Architectures
A simple parallel tree contraction algorithm

Journal of Algorithms
Optimal parallel algorithms for polygon and point-set problems

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs

Discrete & Computational Geometry
A unified geometric approach to graph separators

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Relative neighborhood graphs in three dimensions

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Multidimensional divide-and-conquer

Communications of the ACM

Query-sensitive ray shooting

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
An optimal algorithm for closest pair maintenance (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Approximate range searching

Proceedings of the eleventh annual symposium on Computational geometry
Euclidean spanners: short, thin, and lanky

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Two algorithms for nearest-neighbor search in high dimensions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Algorithms for dynamic closest pair and n-body potential fields

Proceedings of the sixth 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
An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Bounded-error compression of particle data from hierarchical approximate methods

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Bounded-error compression of particle data from hierarchical approximate methods

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Electrostatic fields without singularities: theory and algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Compression of particle data from hierarchical approximate methods

ACM Transactions on Mathematical Software (TOMS)
Analyzing the error bounds of multipole-based treecodes

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Efficient Expected-Case Algorithms for Planar Point Location

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems

FST TCS '01 Proceedings of the 21st 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
On-Line Error Monitoring for Several Data Structures

FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
An optimal hierarchical clustering algorithm for gene expression data

Information Processing Letters
Searching dynamic point sets in spaces with bounded doubling dimension

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
I/O-efficient algorithms for computing planar geometric spanners

Computational Geometry: Theory and Applications
An optimal hierarchical clustering algorithm for gene expression data

Information Processing Letters
High-dimensional entropy estimation for finite accuracy data: R-NN entropy estimator

IPMI'07 Proceedings of the 20th international conference on Information processing in medical imaging
Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Signal Processing
Extracting skeletal curves from 3D scattered data

The Visual Computer: International Journal of Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define the notion of a well-separated pair decomposition of points in d-dimensional space. We develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of k-nearest neighbors and n-body potential fields.