论文信息 - Improved lower bound on the geometric dilation of point sets

Improved lower bound on the geometric dilation of point sets

Let G be an embedded planar graph whose edges are curves. The detour between two points p and q (on edges or vertices) of G is the length of a shortest path connecting p and q in G divided by their Euclidean distance |pq|. The maximum detour over all pairs of points is called the geometric dilation δ(G). Ebbers

[1] M. Sharir,et al. Computing the Detour of Polygonal Curves , 2002 .

[2] Mikhael Gromov. Structures métriques pour les variétés riemanniennes , 1981 .

[3] Aaron Abrams,et al. Circles minimize most knot energies , 2001 .

[4] Andrzej Lingas,et al. A fast algorithm for approximating the detour of a polygonal chain , 2004, Comput. Geom..

[5] Rolf Klein,et al. The Geometric Dilation of Finite Point Sets , 2005, Algorithmica.

[6] Günter Rote,et al. On the geometric dilation of curves and point sets , 2004 .

[7] Pat Morin,et al. Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles , 2002, STACS.

[8] H. Groemer,et al. Stability of Geometric Inequalities , 1993 .

[9] Jirí Matousek,et al. Almost-Tiling the Plane by Ellipses , 1999, Discret. Comput. Geom..

[10] David Eppstein,et al. Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[11] Robert B. Kusnert,et al. On Distortion and Thickness of Knots , 1998 .

[12] Rolf Klein,et al. On the Geometric Dilation of Finite Point Sets , 2003, ISAAC.

[13] Rolf Klein,et al. Geometric dilation of closed planar curves: New lower bounds , 2007, Comput. Geom..