A modified fast marching method

DOI10.1007/3-540-45103-X_151MaRDI QIDQ4448258zbMATH OpenFDO

Authors Per-Erik Danielsson, Qingfen Lin

Publication date 17 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2749/27491154.htm

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Recommendations

• Some improvements of the fast marching method
• Comparison principle for a generalized fast marching method
• Some improvements for the fast sweeping method
• A characteristics driven fast marching method for the eikonal equation
• Generalized fast marching method: applications to image segmentation

Cited in

(8)

• Multi-stencils fast marching method for factored eikonal equations with quadratic anisotropy
• Boat-sail Voronoi diagram on a curved surface
• Some improvements of the fast marching method
• scientific article; zbMATH DE number 781221 (Why is no real title available?)
• Path Counting for Grid-Based Navigation
• Riemannian fast-marching on cartesian grids, using Voronoi's first reduction of quadratic forms
• An adaptive domain-decomposition technique for parallelization of the fast marching method
• Generalized fast marching method: applications to image segmentation

This page was built for publication: A modified fast marching method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448258)