Numerical computation of the cut locus via a variational approximation of the distance function
Fran\c{c}ois G\'en\'erau, \'Edouard Oudet, Bozhidar Velichkov

TL;DR
This paper introduces a novel numerical method for computing the cut locus of a compact submanifold in 3D space using a convex variational approach, with applications to Voronoi cell approximation on surfaces.
Contribution
It presents a new variational technique with proven convergence for the numerical computation of the cut locus, extending its application to Voronoi diagram approximation on embedded surfaces.
Findings
Method successfully computes cut loci with convergence guarantees.
Approach effectively approximates Voronoi cells on surfaces.
Demonstrates versatility on various embedded surfaces.
Abstract
We propose a new method for the numerical computation of the cut locus of a compact submanifold of without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We illustrate the versatility of our approach by the approximation of Voronoi cells on embedded surfaces of .
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
TopicsAdvanced Numerical Analysis Techniques · Contact Mechanics and Variational Inequalities · Numerical methods in inverse problems
