arXiv · 2103.11216
Preprocessing power weighted shortest path data using a s-Well Separated Pair Decomposition
Abstract
For $s$ $>$ 0, we consider an algorithm that computes all $s$-well separated pairs in certain point sets in $\mathbb{R}^{n}$, $n$ $>1$. For an integer $K$ $>1$, we also consider an algorithm that is a permutation of Dijkstra's algorithm, that computes $K$-nearest neighbors using a certain power weighted shortest path metric in $\mathbb{R}^{n}$, $n$ $>$ $1$. We describe each algorithm and their respective dependencies on the input data. We introduce a way to combine both algorithms into a fused algorithm. Several open problems are given for future research.
Explore related subjects
Keep this discovery
Gurpreet S. Kalsi, Steven B. Damelin. 2021-03-20. Preprocessing power weighted shortest path data using a s-Well Separated Pair Decomposition. https://arxiv.org/abs/2103.11216
Cite the original work for its findings. Save a collection to share your selection of sources.