Fast Polynomial Segmentation of Digitized Curves
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1279837
- An effective algorithm for the segmentation of digital plane curves - The isoparametric formulation
- An optimal parallel algorithm for digital curve segmentation
- Polygonal approximation of planar curves in theL1norm
- Line segmentation of digital curves in parallel
Cited in
(14)- Feature controlled adaptive difference operators
- An optimal parallel algorithm for digital curve segmentation
- Efficiently updating feasible regions for fitting discrete polynomial curve
- Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems
- Binary segmentation for multivariate polynomials
- A dynamic programming approach for fitting digital planar curves with line segments and circular arcs
- scientific article; zbMATH DE number 4211509 (Why is no real title available?)
- Ellipse detection with elemental subsets
- scientific article; zbMATH DE number 4109296 (Why is no real title available?)
- An effective algorithm for the segmentation of digital plane curves - The isoparametric formulation
- scientific article; zbMATH DE number 1279837 (Why is no real title available?)
- Line segmentation of digital curves in parallel
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
- Least squares fitting of digital polynomial segments
This page was built for publication: Fast Polynomial Segmentation of Digitized Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386048)
