An O(N log N) algorithm for shape modeling.

DOI10.1073/pnas.93.18.9389zbMath0858.65150OpenAlexW2024762046WikidataQ37350420 ScholiaQ37350420MaRDI QIDQ4714346

No author found.

Publication date: 25 March 1997

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.93.18.9389

zbMATH Keywords

Hamilton-Jacobi equationsfinite differencelevel setsmedical imagesEikonal equationfast marching methodanatomical shapeshigher-dimensional surfaceshape-recovery technique

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Applications to the sciences (65Z05)

Related Items (7)

Transport and diffusion of material quantities on propagating interfaces via level set methods. ⋮ Ordered upwind methods for static Hamilton–Jacobi equations ⋮ Geometric curve flows on parametric manifolds ⋮ Generalized fast marching method: applications to image segmentation ⋮ Solving the eikonal equation on an adaptive mesh ⋮ Evolution, implementation, and application of level set and fast marching methods for advancing fronts ⋮ Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes

This page was built for publication: An O(N log N) algorithm for shape modeling.