O(N) implementation of the fast marching algorithm

A fast marching level set method for monotonically advancing fronts.

James A. Sethian · Proceedings of the National Academy of Sciences · 1996 · 3.2K citations

Natural Sciences, Computational Engineering, Mathematics +16

Euclidean distance mapping

Per‐Erik Danielsson · Computer Graphics and Image Processing · 1980 · 2K citations

A fast sweeping method for Eikonal equations

Hongkai Zhao · Mathematics of Computation · 2004 · 1.1K citations · Full text

Computing, Computer Science, Mathematics +12

Computing geodesic paths on manifolds

Ron Kimmel, James A. Sethian · Proceedings of the National Academy of Sciences · 1998 · 1.1K citations

Computing, Computer Science, Algorithms +12

Efficient algorithms for globally optimal trajectories

John N. Tsitsiklis · IEEE Transactions on Automatic Control · 1995 · 856 citations

Computing, Mechanical Engineering, Algorithms +16