A Convex Optimization Framework for Regularized Geodesic Distances

Abstract

We propose a general convex optimization problem for computing regularized geodesic distances. We show that under mild conditions on the regularizer the problem is well posed. We propose three different regularizers and provide analytical solutions in special cases, as well as corresponding efficient optimization algorithms. Additionally, we show how to generalize the approach to the all pairs case by formulating the problem on the product manifold, which leads to symmetric distances. Our regularized distances compare favorably to existing methods, in terms of robustness and ease of calibration.

arXiv comment11 pages (excluding supplementary material), 14 figures, SIGGRAPH 2023

References in corpus (6)

• Geodesics in Heat
• AmiGo: Computational Design of Amigurumi Crochet Patterns
• A Smoothness Energy without Boundary Distortion for Curved Surfaces
• PH-CPF: Planar Hexagonal Meshing using Coordinate Power Fields
• A Splitting Scheme for Flip-Free Distortion Energies
• Accelerating ADMM for Efficient Simulation and Optimization

Cited by in corpus (3)

• Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes
• A Framework for Solving Parabolic Partial Differential Equations on Discrete Domains
• Local Surface Parameterizations via Smoothed Geodesic Splines