Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average-degrees Preprint: https://arxiv.org/abs/2305.11312