Sciweavers

COMGEO
2007
ACM
13 years 11 months ago
Geometric dilation of closed planar curves: New lower bounds
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 5 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...