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
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Vaxes. A rounding algorithm for approximating minimum manhattan networks

V. Chepoi, K. Nouioua
In Proc. 8th APPROX, • 2005
View 1 Excerpt

Fast contour matching using approximate earth mover's distance

Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. • 2004
View 2 Excerpts

Similar Papers

Loading similar papers…