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)
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
