Vectorizing outlines of generic shapes by cubic spline using simulated annealing
From MaRDI portal
Recommendations
- Capturing outlines of generic shapes with cubic Bézier curves using the Nelder-Mead simplex method
- Outline capturing using rational functions with the help of genetic algorithm
- Optimal spline fitting to planar shape
- Capturing planar shapes by approximating their outlines
- A vector outline descriptor using interpolatory subdivision curves
Cites work
- A new algorithm for dominant points detection and polygonization of digital curves.
- A new approach to edge detection
- A new subdivision based approach for piecewise smooth approximation of 3D polygonal curves
- Capturing planar shapes by approximating their outlines
- Curve fitting and fairing using conic splines
- Extraction of dominant points by estimation of the contour fluctuations
- Global optimization by multilevel coordinate search
- Least-squares fitting of algebraic spline surfaces
- Optimal curve fitting and smoothing using normalized uniform B-splines: a tool for studying complex systems
- Optimization by simulated annealing
- Planar point set fairing and fitting by arc splines
Cited in
(4)- Silhouette vectorization by affine scale-space
- Capturing outlines of generic shapes with cubic Bézier curves using the Nelder-Mead simplex method
- Positivity-preserving scattered data interpolation scheme using the side-vertex method
- Outline capturing using rational functions with the help of genetic algorithm
This page was built for publication: Vectorizing outlines of generic shapes by cubic spline using simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747716)
