A lower bound on the distortion of embedding planar metrics into Euclidean space
From MaRDI portal
Publication:4557541
DOI10.1145/513400.513412zbMath1415.68258OpenAlexW2065195508MaRDI QIDQ4557541
Publication date: 23 November 2018
Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/513400.513412
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (4)
Bandwidth and low dimensional embedding ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Bandwidth and Low Dimensional Embedding ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$
This page was built for publication: A lower bound on the distortion of embedding planar metrics into Euclidean space