The inverse nearest neighbor problem with astrophysical applications

Authors:
Richard Anderson;Brian Tjaden
Affiliations:
Department of Computer Science, University of Washington;Department of Computer Science, University of Washington
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 5
Cited 2

A fast algorithm for particle simulations

Journal of Computational Physics
Parallel hierarchical N-body methods

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

Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Tree data structures for N-body simulation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Outlier Detection with Kernel Density Functions

MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Efficient algorithms for reverse proximity query problems

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses algorithmic improvements to mature astrophysics applications as part of an on-going collaboration with Astrophysicists. We present an efficient algorithm for a variation of the Inverse Nearest Neighbor problem which is a basic computation in an astrophysical N-body simulation. We obtain empirical results demonstrating the improvements, which our algorithm offers to large-scale astrophysical simulations.