3 search results - page 1 / 1 » Geometric dilation of closed planar curves: New lower bounds |
COMGEO
2007
ACM
13 years 11 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
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...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...