Search


Anisotropic Fast Marching in ITK
No opinion
The Fast Marching algorithm is an efficient numerical method for computing the distance and shortest path between points of a domain. For that purpose, it solves a front propagation problem, which can be of interest in itself. The method has numerous [...]


Sort results by

Refine the search results

Keywords

Authors

main_flat
ISSN 2327-770X
Powered by Midas