Deep Accurate Solver for the Geodesic Problem
Saar Huberman, Amit Bracha, Ron Kimmel

TL;DR
This paper introduces a deep learning-based geodesic distance solver that achieves third-order accuracy on surfaces, surpassing traditional methods and previous learning approaches in precision.
Contribution
The paper presents a novel neural network-based local solver for geodesic distances that improves accuracy to third-order and offers a bootstrapping method for further enhancement.
Findings
The deep learning method outperforms classical polyhedral approximations.
The proposed solver achieves third-order accuracy.
Numerical experiments demonstrate superior precision over prior methods.
Abstract
A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon are at most second-order accurate with respect to the distances on the corresponding continuous surface. By order of accuracy we refer to the convergence rate as a function of the average distance between sampled points. Next, a higher-order accurate deep learning method for computing geodesic distances on surfaces is introduced. Traditionally, one considers two main components when computing distances on surfaces: a numerical solver that locally approximates the distance function, and an efficient causal ordering scheme by which surface points are updated. Classical minimal path methods often exploit a dynamic programming principle with quasi-linear…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Shape Modeling and Analysis · Computational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques
