Geodesics in heat: A new approach to computing distance based on heat flow

We introduce the heat method computing the geodesic distance to a subset (e. g. , point or curve) of a given domain. The heat method is robust, efficient, and simple to implement since it is based on solving pair of standard linear elliptic problems. The resulting systems can be prefactored once and subsequently solved in near-linear time. In practice, is updated an order of magnitude faster than with state-of-the-art, while maintaining a comparable level of accuracy. The method requires only standard differential operators and can hence be applied on wide variety of domains (grids, triangle meshes, point clouds, etc. ). We numerical evidence that the method converges to the exact distance the limit of refinement; we also explore smoothed approximations of suitable for applications where greater regularity is required.