Article

Free access

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 KosarajuAuthors Info & Claims

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

Pages 546 - 556

https://doi.org/10.1145/129712.129766

Published: 01 July 1992 Publication History

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.

References

[1]

S. J. Aarseth, J. it. Gott III, and E. L. Turner. N-body simulations of galaxy clustering, i. Initial conditions and galaxy collapse times. The Astrophysical Journal, 228:664-683, 1979.

[2]

K. Abrahamson, N. Dadoun, D. A. Kirkpatrick, and T. Przytcka. A simple parallel tree contraction algorithm. 3ouTnal of AlgoTithms, 10(2):287-302, 1989.

Digital Library

[3]

N. Abramson. Information Theory and Coding. McGraw-Hill, 1963.

[4]

P. K. Agarwal, H. Edelsbrunner, O. Schwartzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete and Computational Geometry, 6:407-422, 1991.

Digital Library

[5]

P. K. Agarwal and J. Matouiek. Relative neighborhood graphs in three dimensions. In Proc. Third Annual Syrup. on Discrete Algorithms, pages 58- 65, 1992.

Digital Library

[6]

A. W. AppeL An efficient program for many-body simulation. SIAM 3. Sci. Stat. Comput., 6:85-103, 1985.

[7]

J. Barnes and P. Hut. A hierarchical O(Nlog N) force-calculation algorithm. Nature, 324(4):446- 449, 1986.

[8]

J. L. Bentley. Multidimensional divide-andconquer. CA CM, 23(4):214-229, 1980.

Digital Library

[9]

1t. Cole and M. T. Goodrich. Optimal parallel algorithms for polygon and point-set problems. In Proc. #th A CM Syrup. on Computational Geometry, pages 201-210, 1988.

Digital Library

[10]

H. Gazit, G. L. Miller, and S.-H. Teng. Optimal tree contraction in the EREW model. In S. K. Tewsburg, B. W. Dickinson, and S. C. Schwartz, editors, Concurrent Computations, pages 139-155. Plenum Publishing, 1988.

[11]

L. Greengard and W. D. Gropp. A parallel version of the fast multipole method. Computers Math. Applic., 20(7):63-71, 1990.

[12]

L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. Journal of Computational Physics, 73:325-348, 1987.

Digital Library

[13]

L. F. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. The MIT Press, 1{)88.

[14]

S. R. Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. In J. Reif, editor, VLSI Algorithms and Architectures: Proceedings of the 3rd Aegean Workshop on Computing, pages 101-110. Springe#- Verlag, 1988.

Digital Library

[15]

G. L. Miller, S.-H. Teng, and S. A. Vavasis. A unified geometric approach to graph separators, in Proc. 32nd Annual Syrup. Found. Comp. So., pages 538-547, 1991.

Digital Library

[16]

R. H. Miller and K. H. Prendergast. Stellar dynamics in a discrete phase space. The Astrophysical 3ournal, 151:699-709, 1968.

[17]

R. H. Miller, K. H. Prendergast, and W. J. Quirk. Numerical experiments on spiral structure. The Astrophysical Journal, 161:903-916, 1970.

[18]

F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.

Digital Library

[19]

J. H. Reif and S. R. Tare. The complexity of nbody simulation. (draft), Computer Science Dept., Duke University, 1992.

[20]

P. M. Vaidya. A fast approximation algorithm for minimum spanning trees in k-dimensional space. In Proc. #5th Annual Syrup. Found. Comp. Sc., pages 403-407, 1984.

Digital Library

[21]

P. M. Vaidya. An optimal algorithm for the allnearest-neighbors problem. In Proc. #Tth Annual Syrup. Found. Comp. Sc., pages 117-122, 1986.

Cited By

Piras DJoachimi BVillaescusa-Navarro F(2023)Fast and realistic large-scale structure from machine-learning-augmented random field simulationsMonthly Notices of the Royal Astronomical Society10.1093/mnras/stad052520:1(668-683)Online publication date: 18-Jan-2023
https://doi.org/10.1093/mnras/stad052
Filtser ANeiman O(2022)Light Spanners for High Dimensional Norms via Stochastic DecompositionsAlgorithmica10.1007/s00453-022-00994-084:10(2987-3007)Online publication date: 28-Jun-2022
https://doi.org/10.1007/s00453-022-00994-0
Bar-On GCarmi P(2017)$$\delta $$-Greedy t-spannerAlgorithms and Data Structures10.1007/978-3-319-62127-2_8(85-96)Online publication date: 5-Jul-2017
https://doi.org/10.1007/978-3-319-62127-2_8
Show More Cited By

Index Terms

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

Recommendations

A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

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 ...
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
SFCS '93: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in R/sup d/. We show how this leads to a deterministic optimal O(log n) time parallel algorithm for finding the k nearest neighbors of each ...
Weighted Version of Extended Nearest Neighbors

In K-nearest neighbor method (KNN), the test data is assigned to a class with the highest frequency in its nearest neighbors. One of KNN challenges is its insufficient accuracy especially for small or imbalance dataset. Recently, to tackle this ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

July 1992

794 pages

ISBN:0897915119

DOI:10.1145/129712

Chairmen:
Rao Kosaraju
Johns Hopkins Univ., Baltimore, MD
,
Mike Fellows
Univ. of Victoria, Victoria, BC, Canada
,
Avi Wigderson
Hebrew University; Princeton Univ., Princeton, NJ
,
John Ellis
Univ. of Victoria, Victoria, BC, Canada

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC92

Sponsor:

SIGACT

STOC92: 24th Annual ACM Symposium on the Theory of Computing 1992

May 4 - 6, 1992

British Columbia, Victoria, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
464
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)12

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Piras DJoachimi BVillaescusa-Navarro F(2023)Fast and realistic large-scale structure from machine-learning-augmented random field simulationsMonthly Notices of the Royal Astronomical Society10.1093/mnras/stad052520:1(668-683)Online publication date: 18-Jan-2023
https://doi.org/10.1093/mnras/stad052
Filtser ANeiman O(2022)Light Spanners for High Dimensional Norms via Stochastic DecompositionsAlgorithmica10.1007/s00453-022-00994-084:10(2987-3007)Online publication date: 28-Jun-2022
https://doi.org/10.1007/s00453-022-00994-0
Bar-On GCarmi P(2017)$$\delta $$-Greedy t-spannerAlgorithms and Data Structures10.1007/978-3-319-62127-2_8(85-96)Online publication date: 5-Jul-2017
https://doi.org/10.1007/978-3-319-62127-2_8
Wang CSong YRoth DZhang MHan J(2016)World Knowledge as Indirect Supervision for Document ClusteringACM Transactions on Knowledge Discovery from Data10.1145/295388111:2(1-36)Online publication date: 26-Dec-2016
https://dl.acm.org/doi/10.1145/2953881
Gao ZJermaine C(2016)Distributed Algorithms for Computing Very Large Thresholded Covariance MatricesACM Transactions on Knowledge Discovery from Data10.1145/293575011:2(1-25)Online publication date: 19-Nov-2016
https://dl.acm.org/doi/10.1145/2935750
Alhindi AKruschwitz UFox CAlbakour M(2015)Profile-Based Summarisation for Web Site NavigationACM Transactions on Information Systems10.1145/269966133:1(1-39)Online publication date: 17-Feb-2015
https://dl.acm.org/doi/10.1145/2699661
Lin CChen KChen SChen CHung Y(2015)Large-Area, Multilayered, and High-Resolution Visual Monitoring Using a Dual-Camera SystemACM Transactions on Multimedia Computing, Communications, and Applications10.1145/264586211:2(1-23)Online publication date: 7-Jan-2015
https://dl.acm.org/doi/10.1145/2645862
Deng ZYan MSang JXu C(2015)Twitter is FasterACM Transactions on Multimedia Computing, Communications, and Applications10.1145/263728511:2(1-23)Online publication date: 7-Jan-2015
https://dl.acm.org/doi/10.1145/2637285
Chisnall D(2014)There’s No Such Thing as a General-purpose ProcessorQueue10.1145/2685690.268701112:10(20-25)Online publication date: 8-Oct-2014
https://dl.acm.org/doi/10.1145/2685690.2687011
Solomon SShmoys D(2014)From hierarchical partitions to hierarchical coversProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591864(363-372)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2591796.2591864
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten