Journal article · 1999

Fast Marching Methods

James A. Sethian

SIAM Review, 41(2), 199–235 · Published 1 January 1999 · DOI 10.1137/s0036144598347059

View at the publisherCite this paper

In brief

“Fast Marching Methods” is a 1999 journal article by James A. Sethian, published in SIAM Review. OpenAlex counts 1,715 citations as of 16 November 2026, which puts it in the top 1% of works published in 1999 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
1,715
Most cited in
2025 (104)
Field-weighted impact
36.51
References
36
Authors
1

Abstract

Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static Hamilton--Jacobi equations. Based on entropy-satisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms. They are optimal in the sense that the computational complexity of the algorithms is O(N log N), where N… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Sethian, J. A. (1999). Fast Marching Methods. SIAM Review, 41(2), 199–235. https://doi.org/10.1137/s0036144598347059

MLA 9

Sethian, James A. “Fast Marching Methods.” SIAM Review, vol. 41, no. 2, 1999, pp. 199–235. https://doi.org/10.1137/s0036144598347059.

Chicago

Sethian, James A. 1999. “Fast Marching Methods.” SIAM Review 41 (2): 199–235. https://doi.org/10.1137/s0036144598347059.

Harvard

Sethian, J. A. (1999) ‘Fast Marching Methods’, SIAM Review, 41(2), pp. 199–235. doi:10.1137/s0036144598347059.

IEEE

J. A. Sethian, “Fast Marching Methods,” SIAM Review, vol. 41, no. 2, pp. 199–235, 1999, doi: 10.1137/s0036144598347059.

BibTeX

@article{sethian1999fast,
  title     = {{Fast Marching Methods}},
  author    = {Sethian, James A.},
  journal   = {SIAM Review},
  year      = {1999},
  volume    = {41},
  number    = {2},
  pages     = {199--235},
  doi       = {10.1137/s0036144598347059},
  url       = {https://doi.org/10.1137/s0036144598347059}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20176363
20186565
20196767
20205656
20216464
20227575
20238888
20248080
2025104104
20265858

Its field-weighted citation impact is 36.51: it has been cited 36.51 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation

  • fast marching method
  • eikonal equation
  • Hamilton-Jacobi equation
  • distance measures
  • shape from shading
  • photolithography
  • seismic travel times
  • optimal path planning

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Sethian, J. A. (1999). Fast Marching Methods. SIAM Review, 41(2), 199–235. https://doi.org/10.1137/s0036144598347059

How many times has this paper been cited?

1,715 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

James A. Sethian.

What is the DOI of this paper?

10.1137/s0036144598347059. The permanent link is https://doi.org/10.1137/s0036144598347059.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.