## Efficient Algorithms for Solving Static Hamilton-Jacobi Equations (2003)

### Cached

### Download Links

- [www.acm.caltech.edu]
- [thesis.library.caltech.edu]
- [diyhpl.us]
- DBLP

### Other Repositories/Bibliography

Citations: | 58 - 6 self |

### BibTeX

@MISC{Mauch03efficientalgorithms,

author = {Sean Mauch},

title = {Efficient Algorithms for Solving Static Hamilton-Jacobi Equations},

year = {2003}

}

### OpenURL

### Abstract

Consider the eikonal equation, = 1. If the initial condition is u = 0 on a manifold, then the solution u is the distance to the manifold. We present a new algorithm for solving this problem. More precisely, we present an algorithm for computing the closest point transform to an explicitly described manifold on a rectilinear grid in low dimensional spaces. The closest point transform finds the closest point on a manifold and the Euclidean distance to a manifold for all the points in a grid (or the grid points within a specified distance of the manifold). We consider manifolds composed of simple geometric shapes, such as, a set of points, piecewise linear curves or triangle meshes. The algorithm computes the closest point on and distance to the manifold by solving the eikonal equation = 1 by the method of characteristics. The method of characteristics is implemented efficiently with the aid of computational geometry and polygon/polyhedron scan conversion. Thus the method is named the characteristic/scan conversion algorithm. The computed distance is accurate to within machine precision. The computational complexity of the algorithm is linear in both the number of grid points and the complexity of the manifold. Thus it has optimal computational complexity. The algorithm is easily adapted to shared-memory and distributed-memory concurrent algorithms. Many query problems...