Abstract
AbstractWe introduce and analyze two new Fast Marching (FM) methods based on a semi‐Lagrangian (SL) approximation (see [2] for a more complete presentation). The Characteristics driven Fast Marching method accepts more than one node at every iteration using a dynamic condition which leads to a faster convergence. The Buffered Fast Marching method allows to deal with convex and non–convex Hamilton–Jacobi equations including anisotropic front propagation and differential games. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
