Embedding metric spaces in the rectilinear plane: a six-point criterion
From MaRDI portal
Publication:1907613
DOI10.1007/BF02716581zbMATH Open0920.51007MaRDI QIDQ1907613FDOQ1907613
Hans-Jürgen Bandelt, Victor Chepoi
Publication date: 13 February 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
- Linearly rigid metric spaces and the embedding problem
- scientific article; zbMATH DE number 1998143
- scientific article; zbMATH DE number 4009213
- Euclidean embeddings of finite metric spaces
- A Menger Redux: Embedding Metric Spaces Isometrically in Euclidean Space
- On uniform embedding of metric spaces
- Embedding into rectilinear spaces
- scientific article; zbMATH DE number 510758
- The isometric embedding problem for length metric spaces
Cites Work
- A canonical decomposition theory for metrics on a finite set
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching binary convexities
- Embedding Topological Median Algebras in Products of Dendrons
- A bounded compactness theorem for \(L^ 1\)-embeddability of metric spaces in the plane
- Superextensions and the depth of median graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
- Fixed finite subgraph theorems in infinite weakly modular graphs
- Embedding metric spaces into normed spaces and estimates of metric capacity
- On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays
- Embedding into the rectilinear grid
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete
- The polytopal structure of the tight-span of a totally split-decomposable metric
This page was built for publication: Embedding metric spaces in the rectilinear plane: a six-point criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907613)
