Embedding into the rectilinear plane in optimal O(n^2) time
From MaRDI portal
Publication:533893
Recommendations
- Embedding into the rectilinear grid
- Embedding into rectilinear spaces
- Optimally fast incremental Manhattan plane embedding and planar tight span construction
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete
- Embedding metric spaces in the rectilinear plane: a six-point criterion
Cites work
- A bounded compactness theorem for \(L^ 1\)-embeddability of metric spaces in the plane
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete
- Embedding into the rectilinear grid
- Embedding metric spaces in the rectilinear plane: a six-point criterion
- Extension of uniformly continuous transformations and hyperconvex metric spaces
- Gated sets in metric spaces
- Geometry of cuts and metrics
- Optimally fast incremental Manhattan plane embedding and planar tight span construction
- Six theorems about injective metric spaces
- The cut cone,L1 embeddability, complexity, and multicommodity flows
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Cited in
(6)- Searching for realizations of finite metric spaces in tight spans
- A new combinatorial approach to optimal embeddings of rectangles
- Embedding into the rectilinear grid
- Level Planar Embedding in Linear Time
- Algorithms for \(\ell_{1}\)-embeddability and related problems
- Optimally fast incremental Manhattan plane embedding and planar tight span construction
This page was built for publication: Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533893)
