Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph

Pegah Kamousi, Sylvain Lazard, Anil Maheshwari +1

A standard way to approximate the distance between any two vertices $p$ and $q$ on a mesh is to compute, in the associated graph, a shortest path from $p$ to $q$ that goes through…