research-article

Free access

The heat method for distance computation

Authors:

Clarisse Weischedel,

Max WardetzkyAuthors Info & Claims

Communications of the ACM, Volume 60, Issue 11

Pages 90 - 99

https://doi.org/10.1145/3131280

Published: 24 October 2017 Publication History

All formats PDF

Abstract

We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains. A key insight is that distance computation can be split into two stages: first find the direction along which distance is increasing, then compute the distance itself. The heat method is robust, efficient, and simple to implement since it is based on solving a pair of standard sparse linear systems. These systems can be factored once and subsequently solved in near-linear time, substantially reducing amortized cost. Real-world performance is an order of magnitude faster than state-of-the-art methods, while maintaining a comparable level of accuracy. The method can be applied in any dimension, and on any domain that admits a gradient and inner product---including regular grids, triangle meshes, and point clouds. Numerical evidence indicates 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 desired.

References

[1]

Alexa, M., Wardetzky, M. Discrete Laplacians on general polygonal meshes. ACM Trans. Graph 30, 4 (2011), 102:1--102:10.

Digital Library

[2]

Belkin, M., Sun, J., Wang, Y. Constructing Laplace operator from point clouds in R<sup>d</sup>. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'09 (New York, 2009). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1031--1040.

Digital Library

[3]

Belyaev, A., Fayolle, P.-A. On variational and PDE-based distance function approximations. Comput. Graph. Forum 34, 8 (2015), 104--118.

Digital Library

[4]

Bommes, D., Kobbelt, L. Accurate computation of geodesic distance fields for polygonal curves on triangle meshes. In Proceedings of Workshop on Vision, Modeling, and Visualization (VMV) (Saarbrücken, Germany, November 7--9, 2007), 151--160.

[5]

Botsch, M., Bommes, D., Kobbelt, L. Efficient linear system solvers for mesh processing. In IMA Conference on the Mathematics of Surfaces, R.R. Martin, H.E. Bez, and M.A. Sabin, eds. Volume 3604 of Lecture Notes in Computer Science (2005). Springer, 62--83.

Digital Library

[6]

Caissard, T., Coeurjolly, D., Gueth, P. DGtal DEC: Discrete Exterior Calculus Package for the Digital Geometry Tools and Algorithms Library (2015)

[7]

Campen, M., Leif K. Walking on broken mesh: Defect-tolerant geodesic distances and parameterizations. Comput. Graph. Forum 30, 2 (2011), 623--632.

[8]

Chen, J., Han, Y. Shortest paths on a polyhedron. Sympos. Comput. Geom. In Proceedings of the Sixth Annual Symposium on Computational Geometry SCG'90 (Berkley, California, USA, 1990). ACM, New York, NY, USA 360--369.

Digital Library

[9]

Chen, Y., Davis, T.A., Hager, W.W., Rajamanickam, S. Algorithm 887: CHOLMOD, supernodal sparse cholesky factorization and update/downdate. ACM Trans. Math. Softw. 35, 3 (October 2008), 14 pp., Article 22.

Digital Library

[10]

Coifman, R.R., Lafon, S. Diffusion maps. Appl. Comput. Harmon. Anal. 21 (2006), 5--30.

[11]

Crane, K., Weischedel, C., Wardetzky, M. Geodesics in heat: A new approach to computing distance based on heat flow. ACM Trans. Graph. 32, 5 (2013), 152:1--152:11.

Digital Library

[12]

de Goes, F., Desbrun, M., Meyer, M., DeRose, T. Subdivision exterior calculus for geometry processing. ACM Trans. Graph. 35, 4 (2016).

Digital Library

[13]

de Goes, F., Liu, B., Budninskiy, M., Tong, Y., Debrun, M. Discrete 2-tensor fields on triangulations. Comput. Graph. Forum 33, 5 (2014), 13--24.

Digital Library

[14]

Fouss, F., Pirotte, A., Renders, J.-M., Marco, S. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19, 3 (2007), 355--369.

Digital Library

[15]

Huth, A., Griffiths, T., Theunissen, F., Gallant, J. PrAGMATiC: A probabilistic and generative model of areas tiling the cortex. arXiv:1504.03622 (2015).

[16]

Hysing, S., Turek, S. The eikonal equation: Numerical efficiency vs. algorithmic complexity. In Proceedings of Algorithmy (2005). Solvak University of Bratslavia, Bratslavia, 22--31.

[17]

Itoh, J-I, Sinclair, R. Thaw: A tool for approximating cut loci on a triangulation of a surface. Exp. Math. 13, 3 (2004), 309--325.

[18]

Jiang, G., Peng, D. Weighted ENO schemes for Hamilton--Jacobi equations. SIAM J. Sci. Comput 21 (1997), 2126--2143.

Digital Library

[19]

Kimmel, R., Sethian, J.A. Fast marching methods on triangulated domains. Proc. Nat. Acad. Sci. 95 (1998), 8341--8435.

[20]

Lin, B., Ji, Y., He, X., Ye, J. Geodesic distance function learning via heat flow on vector fields. In Proceedings of the 31st International Conference on Machine Learning, ICML 2014 (Beijing, China, 21--26 June 2014) Inter. Conf. Mach. Learn. (2014), 145--153.

Digital Library

[21]

Lipman, Y., Rustamov, R.M., Funkhouser, T.A. Biharmonic distance. ACM Trans. Graph. 29, 3 (July 2010), 11 pp., Article 27.

Digital Library

[22]

Liu, Y., Prabhakaran, B., Guo, X. Point-based manifold harmonics. IEEE Trans. Vis. Comput. Graph. 18, 10 (2012), 1693--1703.

Digital Library

[23]

Luo, C., Safa, I., Yusu, W. Approximating gradients for meshes and point clouds via diffusion metric. Comput. Graph. Forum 28, 5 (2009), 1497--1508.

Digital Library

[24]

MacNeal, R. The solution of partial differential equations by means of electrical networks. Ph.D. dissertation, Caltech (1949).

[25]

Memoli, F., Sapiro, G. Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces. J. Comput. Phys. 173 (2001), 730--764.

Digital Library

[26]

Memoli, F., Sapiro, G. Distance functions and geodesics on submanifolds of ℝ<sup>d</sup> and point clouds. SIAM J. Appl. Math. 65, 4 (2005), 1227--1260.

[27]

Mitchell, J., Mount, D., Papadimitriou, C. The discrete geodesic problem. SIAM J. Comput. 16, 4 (1987), 647--668.

Digital Library

[28]

Neel, R., Stroock, D. Analysis of the cut locus via the heat kernel. Surv. Diff. Geom. 9 (2004), 337--349.

[29]

Nguyen, T., Karciauskas, K., Peters, J. C<sup>1</sup> finite elements on non-tensor-product 2d and 3d manifolds. Appl. Math. Comput. (2016).

Digital Library

[30]

Norris, J. Heat kernel asymptotics and the distance function in Lipschitz Riemannian manifolds. Acta Math. 179, 1 (1997), 79--103.

[31]

Peyré, G., Cohen, L.D. Chapter geodesic computations for fast and accurate surface remeshing and parameterization. In Progress in Nonlinear Differential Equations and Their Applications. Volume 63 (2005). Springer, 157--171.

[32]

Rangarajan, A., Gurumoorthy, K. A Fast Eikonal Equation Solver Using the Schrödinger Wave Equation. Technical Report REP-2011-512. CISE, University of Florida, 2011.

[33]

Rustamov, R., Lipman, Y., Funkhouser, T. Interior distance using Barycentric coordinates. Comput. Graph. Forum (Symposium on Geometry Processing) 28, 5 (July 2009), 1279--1288.

Digital Library

[34]

Schmitz, P.G., Ying, L. A fast direct solver for elliptic problems on general meshes in 2D. J. Comput. Phys. 231, 4 (2012), 1314--1338.

Digital Library

[35]

Schrijver, A. On the history of the shortest path problem. Docum. Math. 1 (2012), 155--167.

[36]

Schwarz, G. Hodge Decomposition: A Method for Solving Boundary Value Problems. Springer, Berlin 1995.

[37]

Sethian, J.A. Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision and Materials Science. Cambridge University Press, Cambridge 1996.

[38]

Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., Guibas, L. Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains. ACM Trans. Graph. 34, 4 (2015), 66:1--66:11.

Digital Library

[39]

Spielman, D.A., Teng, S.-H. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proc. ACM Symp. Theory Comput. (STOC '04) (2004). ACM, 81--90.

Digital Library

[40]

Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S.J., Hoppe, H. Fast exact and approximate geodesics on meshes. ACM Trans. Graph. 24, 3 (2005), 553--560.

Digital Library

[41]

van Pelt, R., Gasteiger, R., Lawonn, K., Meuschke, M., Preim, B. Comparative blood flow visualization for cerebral aneurysm treatment assessment. Comput. Graph. Forum 33, 3 (2014), 133--140.

[42]

Varadhan, S.R.S. On the behavior of the fundamental solution of the heat equation with variable coefficients. Comm. Pure Appl. Math. 20, 2 (1967), 431--455.

[43]

Villa, E. Methods of geometric measure theory in stochastic geometry. Ph.D. dissertation. Università degli Studi di Milano (2006).

[44]

Von Renesse, M.-K. Heat kernel comparison on Alexandrov spaces with curvature bounded below. Poten. Anal. 21, 2 (2004), 151--176.

[45]

Yang, F., Cohen, L. Geodesic distance and curves through isotropic and anisotropic heat equations on images and surfaces. J. Math. Imaging Vis. 15, 2 (2015), 210--228.

Digital Library

[46]

Ying, X., Xin, S.-Q., He, Y. Parallel Chen-Han (PCH) algorithm for discrete geodesics. ACM Trans. Graph. 33, 1 (2014), 9:1--9:11.

Digital Library

[47]

Zou, Q., Zhang, J., Deng, B., Zhao, J. Iso-level tool path planning for freeform surfaces. Comput. Aid. Des. 55 (2014), 117--125.

Cited By

Heroux MAndrej JAtallah NBäcker JCamier JCopeland DDobrev VDudouit YDuswald TKeith BKim DKolev TLazarov BMittal KPazner WPetrides SShiraiwa SStowell MTomov V(2024)High-performance finite elements with MFEMInternational Journal of High Performance Computing Applications10.1177/1094342024126198138:5(447-467)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1177/10943420241261981
Liu TZhang TChen YHuang YWang C(2024)Neural Slicer for Multi-Axis 3D PrintingACM Transactions on Graphics10.1145/365821243:4(1-15)Online publication date: 19-Jul-2024
https://dl.acm.org/doi/10.1145/3658212
Blandano GBurger JCappella ADolci CFacchi GPedersini FSforza CTartaglia GHong JPark J(2024)Gender Classification via Graph Convolutional Networks on 3D Facial ModelsProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3636039(482-489)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3636039
Show More Cited By

Index Terms

The heat method for distance computation
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Computation of Normalized Edit Distance and Applications

Given two strings X and Y over a finite alphabet, the normalized edit distance between X and Y, d(X,Y) is defined as the minimum of W(P)/L(P), where P is an editing path between X and Y, W(P) is the sum of the weights of the elementary edit operations ...
Distance computation in the space of phylogenetic trees
Precise Hausdorff distance computation between polygonal meshes

We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events where the Hausdorff distance may occur, is fully classified. These events ...

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM

Communications of the ACM Volume 60, Issue 11

November 2017

95 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3154816

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2017

Published in CACM Volume 60, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed

Funding Sources

Google PhD Fellowship
Fraunhofer Gesellschaft

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

136
Total Citations
View Citations
7,963
Total Downloads

Downloads (Last 12 months)802
Downloads (Last 6 weeks)105

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Heroux MAndrej JAtallah NBäcker JCamier JCopeland DDobrev VDudouit YDuswald TKeith BKim DKolev TLazarov BMittal KPazner WPetrides SShiraiwa SStowell MTomov V(2024)High-performance finite elements with MFEMInternational Journal of High Performance Computing Applications10.1177/1094342024126198138:5(447-467)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1177/10943420241261981
Liu TZhang TChen YHuang YWang C(2024)Neural Slicer for Multi-Axis 3D PrintingACM Transactions on Graphics10.1145/365821243:4(1-15)Online publication date: 19-Jul-2024
https://dl.acm.org/doi/10.1145/3658212
Blandano GBurger JCappella ADolci CFacchi GPedersini FSforza CTartaglia GHong JPark J(2024)Gender Classification via Graph Convolutional Networks on 3D Facial ModelsProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3636039(482-489)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3636039
Akalin KFinnendahl USorkine‐Hornung OAlexa M(2024)Mesh Parameterization Meets Intrinsic TriangulationsComputer Graphics Forum10.1111/cgf.1513443:5Online publication date: 31-Jul-2024
https://doi.org/10.1111/cgf.15134
Bömer JEsser FMarks ERosu RBehnke SKlingbeil LKuhlmann HStachniss CMahlein APaulus S(2024)A 3D printed plant model for accurate and reliable 3D plant phenotypingGigaScience10.1093/gigascience/giae03513Online publication date: 20-Jun-2024
https://doi.org/10.1093/gigascience/giae035
Wang LHu HYu HZhu Q(2024)SemanticMesh: parameterized fusion of semantic components for photogrammetric meshesGeo-spatial Information Science10.1080/10095020.2024.2381592(1-16)Online publication date: 7-Aug-2024
https://doi.org/10.1080/10095020.2024.2381592
Gornet JThomson M(2024)Automated construction of cognitive maps with visual predictive codingNature Machine Intelligence10.1038/s42256-024-00863-16:7(820-833)Online publication date: 18-Jul-2024
https://doi.org/10.1038/s42256-024-00863-1
Huang JLiu J(2024)Derivable Skeletons in Topology Optimization for Length Scale ControlComputer Methods in Applied Mechanics and Engineering10.1016/j.cma.2024.116778421(116778)Online publication date: Mar-2024
https://doi.org/10.1016/j.cma.2024.116778
Hahn JMikula KFrolkovič P(2024)Laplacian regularized eikonal equation with Soner boundary condition on polyhedral meshesComputers & Mathematics with Applications10.1016/j.camwa.2023.12.016156(74-86)Online publication date: Feb-2024
https://doi.org/10.1016/j.camwa.2023.12.016
Wang SYang BBao HHuang J(2024)Alternating size field optimizing and parameterization domain CAD model remeshingComputer Aided Geometric Design10.1016/j.cagd.2024.102294111(102294)Online publication date: Jun-2024
https://doi.org/10.1016/j.cagd.2024.102294
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents