Fast Sweeping Methods for Eikonal Equations on Triangular Meshes

@article{Qian2007FastSM,
  title={Fast Sweeping Methods for Eikonal Equations on Triangular Meshes},
  author={Jianliang Qian and Yong-Tao Zhang and Hongkai Zhao},
  journal={SIAM J. Numerical Analysis},
  year={2007},
  volume={45},
  pages={83-107}
}
The original fast sweeping method, which is an efficient iterative method for stationary Hamilton–Jacobi equations, relies on natural ordering provided by a rectangular mesh. We propose novel ordering strategies so that the fast sweeping method can be extended efficiently and easily to any unstructured mesh. To that end we introduce multiple reference points and order all the nodes according to their lp-metrics to those reference points. We show that these orderings satisfy the two most… CONTINUE READING
63 Extracted Citations
38 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 63 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 38 references

High-order essentially nonoscillatory schemes for Hamilton–Jacobi equations

  • S. Osher, C.-W. Shu
  • SIAM J. Numer. Anal., 28
  • 1991
Highly Influential
11 Excerpts

The nonconvex multi-dimensional Riemann problem for Hamilton- Jacobi equations

  • M. Bardi, S. Osher
  • SIAM J. Math. Anal., 22
  • 1991
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…