The minimum Manhattan network problem

BenkertMarc, WolffAlexander, WidmannFlorian, ShirabeTakeshi · Computational Geometry · 2006

Given a set of points in the plane and a constant t>=1, a Euclidean t-spanner is a network in which, for any pair of points, the ratio of the network distance and the Euclidean distance of the two ...

Read the paper · More papers on PaperTik