On the implementation of fast marching methods for 3D lattices |
|
| Abstract | This technical report discusses Sethian's Fast Marching Method and its higher accuracy variant. Both methods may be used to compute the arrival times at the points of a discrete lattice of a front which is monotonously expanding. Applications of the method include arrival time computation and the construction of distance fields for 2D or 3D objects.
The main aim of this report is to supplement the available papers with a practical guide to the implementation of the method. Through a simple example the Fast Marching Method and its high accuracy variant are compared with regard to speed and precision. |
| Keywords | Fast Marching Methods, Eikonal Equation, Distance Fields |
| Type | Technical report |
| Year | 2001 |
| Publisher | Informatics and Mathematical Modelling, Technical University of Denmark, DTU |
| Address | Richard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby |
| Series | IMM-TR-2001-13 |
| Electronic version(s) | [pdf] |
| BibTeX data | [bibtex] |
| IMM Group(s) | Image Analysis & Computer Graphics |