Preprocessing power weighted shortest path data using a s-Well Separated Pair Decomposition

Gurpreet S. Kalsi, Steven B. Damelin

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…