Embedding into the rectilinear grid

DOI10.1002/(SICI)1097-0037(199809)32:2%3C127::AID-NET5%3E3.0.CO;2-DzbMATH Open0991.54012OpenAlexW2130335163MaRDI QIDQ4540071FDOQ4540071

Authors: Hans-Jürgen Bandelt, Victor Chepoi 

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199809)32:2%3C127::aid-net5%3E3.0.co;2-d

Recommendations

• Embedding metric spaces in the rectilinear plane: a six-point criterion
• A bounded compactness theorem for \(L^ 1\)-embeddability of metric spaces in the plane
• Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
• Embedding into rectilinear spaces
• scientific article; zbMATH DE number 4064518

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Embedding (54C25)

Cited In (7)

• Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
• Embedding grids in surfaces
• Embedding linear orders in grids
• Optimally fast incremental Manhattan plane embedding and planar tight span construction
• A \(T_X\)-approach to some results on cuts and metrics
• Well-spaced labelings of points in rectangular grids
• Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete

This page was built for publication: Embedding into the rectilinear grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540071)