The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
Open accessAbstract
We define the notion of a well-separated pair decomposition of points in d -dimensional space. We then 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Computational geometry. an introduction
Preparata, F. P., & Shamos, M. I. (1985) · Cited by 2,488
Rapid solution of integral equations of classical potential theory
Rokhlin, V (1985) · Journal of Computational Physics · doi:10.1016/0021-9991(85)90002-6 · Cited by 1,414
Information Theory and Coding.
Good, I. J., & Abramson, N. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343598 · Cited by 1,068
The Rapid Evaluation of Potential Fields in Particle Systems
Greengard, L. F. (1988) · The MIT Press eBooks · doi:10.7551/mitpress/5750.001.0001 · Cited by 1,066
Multidimensional divide-and-conquer
Bentley, J. L. (1980) · Communications of the ACM · doi:10.1145/358841.358850 · Cited by 672
An Efficient Program for Many-Body Simulation
Appel, A. W. (1985) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0906008 · Cited by 546
AnO(n logn) algorithm for the all-nearest-neighbors Problem
Vaidya, P. M. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187718 · Cited by 232
Cited by
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
An optimal algorithm for approximate nearest neighbor searching
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1994) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5555/314464.314652 · Cited by 594
Metadata
- Authors
- Callahan, P. B., & Kosaraju, S. R.
- Venue
- Journal of the ACM
- Published
- 1995-01-03
- Volume
- 42
- Issue
- 1
- Pages
- 67-90
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2054011861
- Cited by
- 543
- References
- 15
- FWCI
- 15.86
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields. https://app.cochat.ai/papers/10.1145/200836.200853
- The paper
- Callahan, P. B., & Kosaraju, S. R. (1995). A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields. Journal of the ACM. https://doi.org/10.1145/200836.200853
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
