@INPROCEEDINGS{stein:1999d,
ADDRESS = {Berlin Heidelberg New\,York},
AUTHOR = {Benno Stein and Oliver Niggemann},
BOOKTITLE = {{Graph-Theoretic Concepts in Computer Science}},
EDITOR = {Peter Widmayer and Gabriele Neyer and Stefan Eidenbenz},
ISBN = {3-540-66731-8},
MONTH = jun,
PAGES = {122-134},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
SITE = {25th International Workshop on Graph Theoretic Concepts in Computer Science (WG 99), Ascona}{, Switzerland},
TITLE = {{On the Nature of Structure and its Identification}},
VOLUME = {1665 LNCS},
YEAR = {1999}
}
@INPROCEEDINGS{stein:1999d,
ADDRESS = {Berlin Heidelberg New\,York},
AUTHOR = {Benno Stein and Oliver Niggemann},
BOOKTITLE = {{Graph-Theoretic Concepts in Computer Science}},
EDITOR = {Peter Widmayer and Gabriele Neyer and Stefan Eidenbenz},
ISBN = {3-540-66731-8},
MONTH = jun,
PAGES = {122-134},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
SITE = {25th International Workshop on Graph Theoretic Concepts in Computer Science (WG 99), Ascona}{, Switzerland},
TITLE = {{On the Nature of Structure and its Identification}},
VOLUME = {1665 LNCS},
YEAR = {1999}
}
A Distance measure for Vectors.
The Manhattan Distance of two points is defined as the sum of the
lengths of the projections of the segment between them onto the
coordinate system axis.