Answers are grounded in this paper and cite their sources.
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 ) 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. (2017) and the classical polyhedral method from Mitchell et al. (1987) . • The p-Laplacian gives rise to a new method for approximating geodesic distances. • Imposing natural boundary conditions provides convergent numerical results. • We can numerically handle ill-conditioning effects arising in our p-Poisson model. • Our p-Poisson distance approximations exhibit desirable geometric properties.
No takes yet. Share an insight, caveat, or question.
Potgieter et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: