Efficient fast marching with Finsler metrics

DOI10.1007/s00211-013-0571-3zbMath1297.65074arXiv1208.1430OpenAlexW2123698257MaRDI QIDQ2454033

Jean-Marie Mirebeau

Publication date: 12 June 2014

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.1430

zbMATH Keywords

discretizationcomplexitynumerical experimentsfast marching algorithmanisotropic stencil refinementescape time problemFinsler metric, optimal controlHamilton Jacobi PDEshortest way

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Applications of optimal control and differential games (49N90) Existence theories for optimal control problems involving partial differential equations (49J20) Viscosity solutions to Hamilton-Jacobi equations in optimal control and differential games (49L25) Hamilton-Jacobi equations (35F21)

Related Items

Adaptive, anisotropic and hierarchical cones of discrete convex functions, An efficient jet marcher for computing the quasipotential for 2D SDEs. Enhancing accuracy and efficiency of quasipotential solvers, Monotone discretization of the Monge–Ampère equation of optimal transport, A linear finite-difference scheme for approximating randers distances on cartesian grids, Global minimum for a Finsler elastica minimal path approach, Numerical geometric acoustics: an eikonal-based approach for modeling sound propagation in 3D environments, Quantifying and Managing Uncertainty in Piecewise-Deterministic Markov Processes, Control-Theoretic Models of Environmental Crime, Single pass computation of first seismic wave travel time in three dimensional heterogeneous media with general anisotropy, Augmented Lagrangian methods for degenerate Hamilton-Jacobi equations, Monotone and consistent discretization of the Monge-Ampère operator, Fast asymmetric fronts propagation for image segmentation, Fast-marching methods for curvature penalized shortest paths, Optimal paths for variants of the 2D and 3D Reeds-Shepp car with applications in image analysis, Ordered line integral methods for solving the eikonal equation, Minimal Stencils for Discretizations of Anisotropic PDEs Preserving Causality or the Maximum Principle, Corner cases, singularities, and dynamic factoring, Evasive path planning under surveillance uncertainty, Riemannian Fast-Marching on Cartesian Grids, Using Voronoi's First Reduction of Quadratic Forms, Robust shortest path planning and semicontractive dynamic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
• Geodesic Methods in Computer Vision and Graphics
• Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs
• Homogenization of Metric Hamilton–Jacobi Equations
• Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• A fast sweeping method for Eikonal equations
• Efficient algorithms for globally optimal trajectories
• Fast Marching Methods for Stationary Hamilton–Jacobi Equations with Axis-Aligned Anisotropy
• Remarks on the implementation of the fast marching method