Search arXivSearch

arXiv · math/0407135

On the geometric dilation of closed curves, graphs, and point sets

Abstract

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all pairs of points is called the geometric dilation. Ebbers-Baumann, Gruene and Klein have shown that every finite point set is contained in a planar graph whose geometric dilation is at most 1.678, and some point sets require graphs with dilation at least pi/2 = 1.57... We prove a stronger lower bound of 1.00000000001*pi/2 by relating graphs with small dilation to a problem of packing and covering the plane by circular disks. The proof relies on halving pairs, pairs of points dividing a given closed curve C in two parts of equal length, and their minimum and maximum distances h and H. Additionally, we analyze curves of constant halving distance (h=H), examine the relation of h to other geometric quantities and prove some new dilation bounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote. 2005-08-25. On the geometric dilation of closed curves, graphs, and point sets. https://doi.org/10.1016/j.comgeo.2005.07.004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Godbersen's conjecture and the $L_p$-Rogers-Shephard inequality

We prove that the mixed volume of a convex body of fixed positive volume with its reflection about the origin is maximized by simplices. This confirms a conjecture of C. Godbersen from 1938 and refines the classical Rogers-Shephard inequality. We also prove that simplices are the only extremizers among convex polytopes. Finally, we use this inequality to prove an $L_p$-version of the Rogers-Shephard inequality for convex bodies containing the origin and show that, for any $p\in(1,\infty]$, the only extremizers are simplices with a vertex at the origin.

math.MG

Tight Stability Estimates Near the Simplex and Applications for the Banach-Mazur Distance and Rogers-Shephard-Type Inequalities

We establish a tight stability estimate for the Minkowski asymmetry near its maximal value, improving earlier results in both the range for the admissible error and the strength of the estimate. More precisely, if an $n$-dimensional convex body $K$ has Minkowski asymmetry $s(K) \geq n-\varepsilon$ for $\varepsilon \in [0,1)$, then its Banach-Mazur distance to the $n$-simplex is at most \[ 1 + \varepsilon + \frac{\varepsilon^2}{2(1-\varepsilon)}. \] This dimension-independent estimate is sharp to the linear order in $\varepsilon$, including the constant. We apply this estimate to several problems. First, we prove a stability result for the maximal Banach-Mazur distance to the Euclidean ball, improving a previous estimate to the optimal linear order. As a key ingredient, we verify the conjecture that every convex body $K$ contains a translated copy of its volume-minimal circumscribed ellipsoid scaled down by a factor $\sqrt{n s(K)}$. Second, we prove a sharp common generalization of Schneider's higher-order Rogers-Shephard inequality and the $L_p$-Rogers-Shephard inequality, and establish a stability result of the optimal linear order. These results are based on the recent positive answer to the inequality part of the higher-order Godbersen conjecture and the accompanying proof of the $L_p$-Rogers-Shephard inequality. Finally, we improve upper bounds for the diameter of the Banach-Mazur compactum in fixed dimensions.

math.MG

Busemann G-spaces with convex balls

We prove that any Busemann G-space such that every sufficiently small metric ball is convex is a topological manifold. The key ingredient in the proof is Ivanov's Helly theorem. The appendix contains a counterexample to a question of Berestovskii--Halverson--Repovš.

math.MG