.png){kind=icon}
返回
O(N) implementation of the fast marching algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2005.08.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that in practice reduces the original run-time from O(NlogN) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantization of the priorities in the marching computation. We present the underlying framework, estimations on the error, and examples showing the usefulness of the proposed approach. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
fast marching
Hamilton-Jacobi and Eikonal equations
distance functions
bucket sort
untidy priority queue
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容