Geodesics In Heat

Keenan Crane, Clarisse Weischedel, Max Wardetzky

Save to my Library

Download PDF

Analyze on Scholarcy Visualize in Litmaps

Reduce the time it takes to create your bibliography by a factor of 10 by using the world’s favourite reference manager

Time to take this seriously.

Get Citationsy

We 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.