Pestov–Ionin theorem

From HandWiki
Short description: Theorem that curves of bounded curvature contain a unit disk

A smooth simple closed curve of curvature at most one, and a unit disk enclosed by it

The Pestov–Ionin theorem in the differential geometry of plane curves states that every simple closed curve of curvature at most one encloses a unit disk.

History and generalizations

Although a version of this was published for convex curves by Wilhelm Blaschke in 1916,[1] it is named for German Gavrilovich Pestov (ru) and Vladimir Kuzmich Ionin (ru), who published a version of this theorem in 1959 for non-convex doubly differentiable ([math]\displaystyle{ C^2 }[/math]) curves, the curves for which the curvature is well-defined at every point.[2] The theorem has been generalized further, to curves of bounded average curvature (singly differentiable, and satisfying a Lipschitz condition on the derivative),[3] and to curves of bounded convex curvature (each point of the curve touches a unit disk that, within some small neighborhood of the point, remains interior to the curve).[4]

Applications

The theorem has been applied in algorithms for motion planning. In particular it has been used for finding Dubins paths, shortest routes for vehicles that can move only in a forwards direction and that can turn left or right with a bounded turning radius.[3][5] It has also been used for planning the motion of the cutter in a milling machine for pocket machining,[4] and in reconstructing curves from scattered data points.[6]

References

  1. "24.II: Kleinster und größter Krümmungskreis einer konvexen Kurve" (in de), Kreis und Kugel, Veit, 1916, pp. 114–117, https://archive.org/details/kreisundkugel00blasgoog/page/n131 
  2. Pestov, G.; Ionin, V. (1959), "On the largest possible circle imbedded in a given closed curve" (in ru), Proceedings of the USSR Academy of Sciences 127: 1170–1172 
  3. 3.0 3.1 Ahn, Hee-Kap (2012), "Reachability by paths of bounded curvature in a convex polygon", Computational Geometry 45 (1–2): 21–32, doi:10.1016/j.comgeo.2011.07.003 
  4. 4.0 4.1 Aamand, Anders; Abrahamsen, Mikkel (2020), "Disks in curves of bounded convex curvature", The American Mathematical Monthly 127 (7): 579–593, doi:10.1080/00029890.2020.1752602 
  5. "Curvature-constrained shortest paths in a convex polygon", SIAM Journal on Computing 31 (6): 1814–1851, 2002, doi:10.1137/S0097539700374550 
  6. Guha, Sumanta; Tran, Son Dinh (2005), "Reconstructing curves without Delaunay computation", Algorithmica 42 (1): 75–94, doi:10.1007/s00453-004-1141-y