O(\(N\)) implementation of the fast marching algorithm (Q2581675)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2245070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | O(\(N\)) implementation of the fast marching algorithm |
scientific article; zbMATH DE number 2245070 |
Statements
O(\(N\)) implementation of the fast marching algorithm (English)
0 references
10 January 2006
0 references
fast marching algorithm
0 references
eikonal equations
0 references
error bound
0 references
numerical examples
0 references
static Hamilton-Jacobi equation
0 references
0 references
0 references
0.915952444076538
0 references
0.8180532455444336
0 references
0.8091831207275391
0 references
0.8090886473655701
0 references
0.8090683817863464
0 references
