22 search results - page 1 / 5 » On the geometric dilation of closed curves, graphs, and poin... |
COMGEO
2007
ACM
13 years 5 months ago
2007
ACM
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
COMGEO
2007
ACM
13 years 5 months ago
2007
ACM
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...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
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...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...