Sciweavers

2 search results - page 1 / 1
» The Unit Distance Problem for Centrally Symmetric Convex Pol...
Sort
View
67
Voted
DCG
2002
76views more  DCG 2002»
14 years 9 months ago
The Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
Bernardo M. Ábrego, Silvia Fernández...
88
Voted
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 3 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 ...