.png){kind=icon}
返回
The Heat Method for Distance Computation
.png){kind=icon}
PRE
AI
DOI：10.1145/3131280.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
GEODESICS
MESHES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
EARLY DETECTION OF IMPLANTATION USING A RADIOIMMUNOASSAY SPECIFIC FOR HUMAN CHORIONIC GONADOTROPIN
PREAI
分享收藏
查看更多内容