Abstract
In this talk I will discuss techniques and heuristics for subsampling metric data as well as a space
of tree-like data structures that one might build on top of such samples, generalizing cover trees,
net trees, navigating nets, deformable spanners, and some classes of hierarchical spanners.