Vectorizing outlines of generic shapes by cubic spline using simulated annealing
From MaRDI portal
Publication:5747716
DOI10.1080/00207160802452519zbMath1195.65084OpenAlexW2130196195MaRDI QIDQ5747716
Publication date: 14 September 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802452519
Related Items (4)
Silhouette vectorization by affine scale-space ⋮ Capturing outlines of generic shapes with cubic B´ezier 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
Cites Work
- Optimization by Simulated Annealing
- Planar point set fairing and fitting by arc splines
- Curve fitting and fairing using conic splines
- Capturing planar shapes by approximating their outlines
- Global optimization by multilevel coordinate search
- A new algorithm for dominant points detection and polygonization of digital curves.
- Least-squares fitting of algebraic spline surfaces
- Extraction of dominant points by estimation of the contour fluctuations
- A new approach to edge detection
- A new subdivision based approach for piecewise smooth approximation of 3D polygonal curves
- Optimal curve fitting and smoothing using normalized uniform B-splines: a tool for studying complex systems
This page was built for publication: Vectorizing outlines of generic shapes by cubic spline using simulated annealing