On the numerical approximation of the length of (implicit) level curves

DOI10.1007/S10915-007-9148-6MaRDI QIDQ618350zbMATH OpenOpenAlexFDO

Authors V. Candela, Antonio Marquina

Publication date 16 January 2011

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10915-007-9148-6

zbMATH Keywords

Dirac delta functionlength of implicit curveslevel set methodsRichardson extrapolationsigned distance functions

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Analysis of algorithms (68W40)

Recommendations

• Numerical curve length calculation using polynomial interpolation
• scientific article; zbMATH DE number 2084500
• Numerical parameterization of curves and surfaces
• An evolution-based approach for approximate parameterization of implicitly defined curves by polynomial parametric spline curves
• Implicitization and distance bounds

Cites work

• A flux-split algorithm applied to conservative models for multicomponent compressible flows.
• A level set approach for computing solutions to incompressible two-phase flow
• Active contours without edges
• Computing interface motion in compressible gas dynamics
• Discretization of Dirac delta functions in level set methods
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Level set methods and dynamic implicit surfaces
• Level set methods: An overview and some recent results
• The numerical approximation of a delta function with application to level set methods

Cited in

(2)

• On the Lengths of Level Curves
• A convergence rate theorem for finite difference approximations to delta functions

This page was built for publication: On the numerical approximation of the length of (implicit) level curves

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