Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction

Details Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction

2012-01-07

arxiv.org/abs/1201.1546v1

Mathematics

Numerical Analysis

22 pages, 5 figures

Scientific paper

We introduce a modification of the Fast Marching Algorithm, which solves the generalized eikonal equation associated to an arbitrary continuous riemannian metric, on a two or three dimensional box domain. The algorithm has a logarithmic complexity in the maximum anisotropy ratio of the riemannian metric, which allows to handle extreme anisotropies for a reduced numerical cost. We establish that the output of the algorithm converges towards the viscosity solution of continuous problem, as the discretization step tends to zero. The algorithm is based on the computation at each grid point of a reduced basis of the unit lattice, with respect to the symmetric positive definite matrix encoding the desired anisotropy at this point.

Affiliated with

Also associated with

No associations

Rating

Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635145