Abstract.
We show that the problem whether a given finite metric space (X,d) can be embedded into the rectilinear space R m can be formulated in terms of m -colorability of a certain hypergraph associated with (X,d) . This is used to close a gap in the proof of an assertion of Bandelt and Chepoi [2] on certain critical metric spaces for this embedding problem. We also consider the question of determining the maximum number of equidistant points that can be placed in the m -dimensional rectilinear space and show that this number is equal to 2m for m ≤ 3 .
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received March 19, 1996, and in revised form March 14, 1997.
Rights and permissions
About this article
Cite this article
-J. Bandelt, H., Chepoi, V. & Laurent, M. Embedding into Rectilinear Spaces. Discrete Comput Geom 19, 595–604 (1998). https://doi.org/10.1007/PL00009370
Issue Date:
DOI: https://doi.org/10.1007/PL00009370