GEORCE: A Fast New Control Algorithm for Computing Geodesics
By: Frederik Möbius Rygaard, Søren Hauberg
Potential Business Impact:
Finds shortest paths on complex shapes faster.
Computing geodesics for Riemannian manifolds is a difficult task that often relies on numerical approximations. However, these approximations tend to be either numerically unstable, have slow convergence, or scale poorly with manifold dimension and number of grid points. We introduce a new algorithm called GEORCE that computes geodesics via a transformation into a discrete control problem. We show that GEORCE has global convergence and quadratic local convergence. In addition, we show that it extends to Finsler manifolds. For both Finslerian and Riemannian manifolds, we thoroughly benchmark GEORCE against several alternative optimization algorithms and show empirically that it has a much faster and more accurate performance for a variety of manifolds, including key manifolds from information theory and manifolds that are learned using generative models.
Similar Papers
Analysis of the Geometric Heat Flow Equation: Computing Geodesics in Real-Time with Convergence Guarantees
Systems and Control
Finds shortest paths on curved surfaces quickly.
Simultaneous Optimization of Geodesics and Fréchet Means
Machine Learning (Stat)
Finds the average shape faster and more accurately.
Discrete Geodesic Calculus in the Space of Sobolev Curves
Numerical Analysis
Helps computers measure how shapes change over time.