Small Manhattan Networks and Algorithmic Applications for the Earth Mover ’ s Distance

@inproceedings{Gudmundsson2007SmallMN,
title={Small Manhattan Networks and Algorithmic Applications for the Earth Mover ’ s Distance},
author={Joachim Gudmundsson and Oliver Klein and Christian Knauer and Michiel H. M. Smid},
year={2007}
}

Given a set S of n points in the plane, a Manhattan network on S is a (not necessarily planar) rectilinear network G with the property that for every pair of points in S the network G contains a path between them whose length is equal to the Manhattan distance between the points. A Manhattan network on S can be thought of as a graph G = (V,E) where the vertex set V corresponds to the points of S and a set of Steiner points S′. The edges in E correspond to horizontal and vertical line segments… CONTINUE READING