The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Geodesics in heat: A new approach to computing distance based on heat flow
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Sethian, J. A. (1999) · Cited by 3,622
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
Computing geodesic paths on manifolds
Kimmel, R., & Sethian, J. A. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.15.8431 · Cited by 1,049
Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2005.07.004 · Cited by 990
Spielman, D. A., & Teng, S.-H. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007372 · Cited by 769
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Mitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H. (1987) · SIAM Journal on Computing · doi:10.1137/0216045 · Cited by 720
Fast exact and approximate geodesics on meshes
Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S. J., & Hoppe, H. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073228 · Cited by 502
Lipman, Y., Rustamov, R. M., & Funkhouser, T. A. (2010) · ACM Transactions on Graphics · doi:10.1145/1805964.1805971 · Cited by 175
Parallel algorithms for approximation of distance maps on parametric surfaces
Weber, O., Devir, Y. S., Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2008) · ACM Transactions on Graphics · doi:10.1145/1409625.1409626 · Cited by 148
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid
Tam, G. K. L., Cheng, Z.-Q., Lai, Y.-K., Langbein, F. C., Liu, Y., Marshall, D., Martin, R. R., Sun, X.-F., & Rosin, P. L. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.310 · Cited by 679
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Xu, Z., Zhou, Y., Kalogerakis, E., Landreth, C., & Singh, K. (2020) · ACM Transactions on Graphics · doi:10.1145/3386569.3392379 · Cited by 126
IntrA: 3D Intracranial Aneurysm Dataset for Deep Learning
Yang, X., Xia, D., Kin, T., & Igarashi, T. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00273 · Cited by 99
Metadata
- Authors
- Crane, K., Weischedel, C., & Wardetzky, M.
- Venue
- ACM Transactions on Graphics
- Published
- 2013-09
- Volume
- 32
- Issue
- 5
- Pages
- 1-11
- ISSN
- 2331-8422 (ISSN-L)
- 0730-0301
- 1557-7368
- OpenAlex
- W1981784948
- Cited by
- 297
- References
- 18
- Type
- posted content
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Geodesics in heat: A new approach to computing distance based on heat flow. https://app.cochat.ai/papers/10.1145/2516971.2516977
- The paper
- Crane, K., Weischedel, C., & Wardetzky, M. (2013). Geodesics in heat: A new approach to computing distance based on heat flow. ACM Transactions on Graphics. https://doi.org/10.1145/2516971.2516977
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
