# Geodesic distance approximation using a surface finite element method for the p-Laplacian

arXiv: https://arxiv.org/abs/2505.14732 · HTML: https://mlsanity.com/paper/2505.14732/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 May 2025.

## Built on by (most cited first, 1 of 1)

- [Deep-Learning Solvers and Surrogates for Infinity and p-Laplace Problems](https://mlsanity.com/paper/2609.30809/) (2026)

## Abstract (arXiv)

We use the p-Laplacian with large p-values in order to approximate geodesic distances to features on surfaces. This differs from Fayolle and Belyaev's (2018) [1] computational results using the p-Laplacian for the distance-to-surface problem. Our approach appears to offer some distinct advantages over other popular PDE-based distance function approximation methods. We employ a surface finite element scheme and demonstrate numerical convergence to the true geodesic distance functions. We check that our numerical results adhere to the triangle inequality and examine robustness against geometric noise such as vertex perturbations. We also present comparisons of our method with the heat method from Crane et al. [2] and the classical polyhedral method from Mitchell et al. [3].
