Whenever I walk to/from home, I have to walk up/down an inclined street; I noticed that the asphalt floor has different curvatures depending on how near it is of a bend, and I try to find a less steep incline while walking.
This got me inspiration for the few questions below. Any simple explanations, and related links, are welcome.
Given a #differentiable surface within R^3, and two distinct points in it, there are infinitely many differentiable paths from one point to another, remaining on the surface. At each point of the #path, one can find the path's local #curvature. Then:
- Find a path that minimizes the supreme of the curvature. In other words, find the "flattest" path.
- Find a path that minimizes the variation of the curvature. In other words, find a path that "most resembles" a circle arc.
Are these tasks always possible within the given conditions? Are any stronger conditions needed? Are there cases with an #analytic solution, or are they possible only with numerical approximations?
#Analysis #DifferentialGeometry #Calculus #DifferentialEquations #NumericalMethods