Crane, KeenanKeenanCraneWeischedel, ClarisseClarisseWeischedelWardetzky, MaxMaxWardetzky2017-09-072017-09-072013https://resolver.sub.uni-goettingen.de/purl?gro-2/4302We introduce the heat method for computing the geodesic distance to a specified 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 a pair of standard linear elliptic problems. The resulting systems can be prefactored once and subsequently solved in near-linear time. In practice, distance is updated an order of magnitude faster than with state-of-the-art methods, while maintaining a comparable level of accuracy. The method requires only standard differential operators and can hence be applied on a wide variety of domains (grids, triangle meshes, point clouds, etc.). We provide numerical evidence that the method converges to the exact distance in the limit of refinement; we also explore smoothed approximations of distance suitable for applications where greater regularity is required.enjournal_article10.1145/2516971.25169773146519