2 search results - page 1 / 1 » The Unit Distance Problem for Centrally Symmetric Convex Pol... |
DCG
2002
13 years 11 months ago
2002
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...
WADS
2005
Springer
14 years 4 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...