Trettner, PhilipBommes, DavidKobbelt, LeifDigne, Julie and Crane, Keenan2021-07-102021-07-1020211467-8659https://doi.org/10.1111/cgf.14371https://diglib.eg.org:443/handle/10.1111/cgf14371We present a highly practical, efficient, and versatile approach for computing approximate geodesic distances. The method is designed to operate on triangle meshes and a set of point sources on the surface. We also show extensions for all kinds of geometric input including inconsistent triangle soups and point clouds, as well as other source types, such as lines. The algorithm is based on the propagation of virtual sources and hence easy to implement. We extensively evaluate our method on about 10000 meshes taken from the Thingi10k and the Tet Meshing in theWild data sets. Our approach clearly outperforms previous approximate methods in terms of runtime efficiency and accuracy. Through careful implementation and cache optimization, we achieve runtimes comparable to other elementary mesh operations (e.g. smoothing, curvature estimation) such that geodesic distances become a ''first-class citizen'' in the toolbox of geometric operations. Our method can be parallelized and we observe up to 6x speed-up on the CPU and 20x on the GPU. We present a number of mesh processing tasks easily implemented on the basis of fast geodesic distances. The source code of our method is provided as a C++ library under the MIT license.Computing methodologiesMesh geometry modelsTheory of computationComputational geometry10.1111/cgf.14371247-260