An O(N log N) algorithm for shape modeling.
From MaRDI portal
anatomical shapesEikonal equationfast marching methodfinite differenceHamilton-Jacobi equationshigher-dimensional surfacelevel setsmedical imagesshape-recovery technique
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) Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55)
Recommendations
- Structured discrete shape approximation: theoretical complexity and practical algorithm
- Shape approximation using k-order alpha-hulls
- A shape preserving representation with an evaluation algorithm of linear complexity
- scientific article; zbMATH DE number 2043573
- A fast level set based algorithm for topology-independent shape modeling.
- scientific article; zbMATH DE number 4060715
- A computational model of multidimensional shape
- Publication:3199982
Cited in
(8)- Transport and diffusion of material quantities on propagating interfaces via level set methods.
- Solving the eikonal equation on an adaptive mesh
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- Ordered upwind methods for static Hamilton–Jacobi equations
- scientific article; zbMATH DE number 1787235 (Why is no real title available?)
- Evolution, implementation, and application of level set and fast marching methods for advancing fronts
- Geometric curve flows on parametric manifolds
- Generalized fast marching method: applications to image segmentation
This page was built for publication: An O(N log N) algorithm for shape modeling.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714346)