On the 3-distortion of a path
Computational Geometry
2008-05-19 v2
Authors:
Pierre Dehornoy
Abstract
We prove that, when a path of length n is embedded in R^2, the 3-distortion is an Omega(n^{1/2}), and that, when embedded in R^d, the 3-distortion is an O(n^{1/d-1}).
Cite
@article{arxiv.cs/0601128,
title = {On the 3-distortion of a path},
author = {Pierre Dehornoy},
journal= {arXiv preprint arXiv:cs/0601128},
year = {2008}
}
Related papers
View all related →
Computational Geometry · Computer Science
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel Smid +1
2016-07-20
Computational Geometry · Computer Science
Inapproximability for metric embeddings into R^d
Jiri Matousek, Anastasios Sidiropoulos
2009-09-29
Metric Geometry · Mathematics
Breaking the 3/2 barrier for unit distances in three dimensions
Joshua Zahl
2022-03-02
Machine Learning · Computer Science
On the Complexity of the Weighted Fused Lasso
Jose Bento, Ralph Furmaniak, Surjyendu Ray
2018-10-17
Combinatorics · Mathematics
Long induced paths in graphs
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
2016-12-20
Combinatorics · Mathematics
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
2015-06-12
Combinatorics · Mathematics
A classification of rotary embeddings of multicycles
Zhaochen Ding, Zheng Guo, Luyi Liu
2026-03-20
Discrete Mathematics · Computer Science
Unit-length embedding of cycles and paths on grid graphs
Asghar Asgharian Sardroud, Alireza Bagheri
2014-10-10
Group Theory · Mathematics
Distortion of surfaces in 3-manifolds
Hoang Thanh Nguyen
2019-07-03
Group Theory · Mathematics
Distortion of surfaces in graph manifolds
G. Christopher Hruska, Hoang Thanh Nguyen
2019-02-13
Combinatorics · Mathematics
Cycles in Oriented 3-graphs
Imre Leader, Ta Sheng Tan
2014-09-04
Combinatorics · Mathematics
Erd\H{o}s Distance Problem in $\mathbb{R}^d$
Esen Aksoy Yazici
2020-02-13
Data Structures and Algorithms · Computer Science
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
Haitao Wang
2016-08-17
Classical Analysis and ODEs · Mathematics
Rectifiability and finite variation
Matthew Hendtlass
2018-06-22
Data Structures and Algorithms · Computer Science
Revisiting Path Contraction and Cycle Contraction
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2024-03-12
Combinatorics · Mathematics
$\partial$-invariant path generators for digraphs
Zhenzhi Li, Wujie Shen
2026-03-11
Computational Geometry · Computer Science
Simultaneous Embedding of Two Paths on the Grid
Stephen Kobourov, William Lenhart, Giuseppe Liotta, Daniel Perz +2
2026-03-11
Data Structures and Algorithms · Computer Science
Line-distortion, Bandwidth and Path-length of a graph
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2014-10-01
Algebraic Topology · Mathematics
Some new embeddings and nonimmersions of real projective spaces
Donald M. Davis, Vitaly Zelov
2007-05-23
Computational Geometry · Computer Science
Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier
Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore
2022-05-18
Computational Geometry · Computer Science
Monotone Paths in Geometric Triangulations
Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth
2016-10-05
Data Structures and Algorithms · Computer Science
Finding paths of length k in O*(2^k) time
Ryan Williams
2010-01-05
Metric Geometry · Mathematics
A note on dichotomies for metric transforms
Manor Mendel, Assaf Naor
2011-02-10
Probability · Mathematics
The number of open paths in an oriented $\rho$-percolation model
Francis Comets, Serguei Popov, Marina Vachkovskaia
2012-01-31
Computational Geometry · Computer Science
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
Michael Soss, Jeff Erickson, Mark Overmars
2007-05-23