Quadratic-Order Geodesics on Meshes
Yue Ruan, Albert Chern, Tzu-Mao Li, Kartic Subr, Amir Vaxman

TL;DR
This paper presents a new quadratic-order method for computing discrete geodesics on triangle meshes, improving accuracy and artifact reduction over existing linear methods, especially on coarse or uneven meshes.
Contribution
It introduces a novel quadratic representation and optimization framework for geodesics that enhances accuracy and flexibility compared to prior linear approaches.
Findings
Exact reproduction of flat distances regardless of mesh quality
Improved accuracy on curved meshes
Supports sources anywhere on the mesh surface
Abstract
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from point and curve sources using piecewise-quadratic elements, exactly reproducing flat distances regardless of mesh quality while improving accuracy over existing approaches on curved meshes. The formulation naturally supports sources placed anywhere on the mesh, not just at vertices.
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
