A lower bound on the distortion of embedding planar metrics into Euclidean space
From MaRDI portal
Publication:1864139
DOI10.1007/s00454-002-2813-5zbMath1050.68154OpenAlexW2001075173MaRDI QIDQ1864139
Publication date: 17 March 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-002-2813-5
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (11)
Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs ⋮ Coarse differentiation and multi-flows in planar graphs ⋮ A CODING OF BUNDLE GRAPHS AND THEIR EMBEDDINGS INTO BANACH SPACES ⋮ Metric Embedding via Shortest Path Decompositions ⋮ Markov type and threshold embeddings ⋮ Distortion of embeddings of binary trees into diamond graphs ⋮ Maximum gradient embeddings and monotone clustering ⋮ On the optimality of gluing over scales ⋮ Speed of random walks, isoperimetry and compression of finitely generated groups ⋮ On average distortion of embedding metrics into the line ⋮ Snowflake universality of Wasserstein spaces
This page was built for publication: A lower bound on the distortion of embedding planar metrics into Euclidean space
