The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
Open accessAbstract
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O ( M log M ) steps, where M is the total number of grid points. The scheme relies on an upwind finite difference approximation to the gradient and a resulting causality relationship that lends itself to a Dijkstra-like programming approach. In this paper, we discuss several extensions to this technique, including higher order versions on unstructured meshes in R n and on manifolds and connections to more general static Hamilton–Jacobi equations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Self-citationSethian, J. A. (1999) · Cited by 3,622
Self-citationA fast marching level set method for monotonically advancing fronts.
Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.4.1591 · Cited by 3,221
Self-citationA Fast Level Set Method for Propagating Interfaces
Adalsteinsson, D., & Sethian, J. A. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1098 · Cited by 1,326
Self-citationComputing geodesic paths on manifolds
Kimmel, R., & Sethian, J. A. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.15.8431 · Cited by 1,049
Self-citationA Viscosity Solutions Approach to Shape-From-Shading
Rouy, E., & Tourin, A. (1992) · SIAM Journal on Numerical Analysis · doi:10.1137/0729053 · Cited by 657
Curvature and the evolution of fronts
Sethian, J. A. (1985) · Communications in Mathematical Physics · doi:10.1007/bf01210742 · Cited by 425
Self-citationAn O(N log N) algorithm for shape modeling.
Malladi, R., & Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.18.9389 · Cited by 84
Self-citation
Cited by
Blood vessel segmentation algorithms — Review of methods, datasets and evaluation metrics
Moccia, S., De Momi, E., El Hadji, S., & Mattos, L. S. (2018) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2018.02.001 · Cited by 567
Path Planning for Autonomous Underwater Vehicles
Petres, C., Pailhas, Y., Patron, P., Petillot, Y., Evans, J., & Lane, D. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.895057 · Cited by 433
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
Sethian, J. A., & Vladimirsky, A. (2003) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142901392742 · Cited by 366
Self-citationHassouna, M. S., & Farag, A. A. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1154 · Cited by 323
Metadata
- Authors
- Sethian, J. A., & Vladimirsky, A.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2000-05-16
- Volume
- 97
- Issue
- 11
- Pages
- 5699-5703
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W1990466879
- Cited by
- 307
- References
- 9
- FWCI
- 4.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes. https://app.cochat.ai/papers/10.1073/pnas.090060097
- The paper
- Sethian, J. A., & Vladimirsky, A. (2000). Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.090060097
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.