Before revision:  We give fast algorithms to compute sparse spanners of this distance, a problem that can be seen as a generalization of both the Euclidean spanner and the Euclidean MST problem.
After revision:  We give fast algorithms to compute sparse spanners and persistent homology. We also explore the behavior of the Euclidean MST problem.