An efficient algorithm for the optimal polygonal approximation of digitized curves
From MaRDI portal
Recommendations
- An optimal algorithm for polygonal approximation of digitized curves
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Optimum polygonal approximation of digitized curves
Cited in
(25)- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
- Some algorithms under non-parametric framework versus an unsupervised approach
- A non-parametric sequential method for polygonal approximation of digital curves
- Improving fitting quality of polygonal approximation by using the dynamic programming technique
- Radial symmetries based decomposition of cell clusters in binary and gray level images
- An optimal parallel algorithm for digital curve segmentation
- scientific article; zbMATH DE number 1222818 (Why is no real title available?)
- An adaptive split-and-merge method for binary image contour data compression
- A data reduction algorithm for planar curves
- Algorithm for circle approximation and generation
- Speeding up simplification of polygonal curves using nested approximations
- Polygonal approximation of digital planar curves through vertex betweenness
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- Structural, Syntactic, and Statistical Pattern Recognition
- Data reduction of large vector graphics
- Polygonal approximation and scale-space analysis of closed digital curves
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Optimum polygonal approximation of digitized curves
- An optimal algorithm for polygonal approximation of digitized curves
- scientific article; zbMATH DE number 98536 (Why is no real title available?)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- scientific article; zbMATH DE number 1200214 (Why is no real title available?)
- Polygonal approximation of digital planar curves through break point suppression
- Polygonal approximation of closed discrete curves
This page was built for publication: An efficient algorithm for the optimal polygonal approximation of digitized curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2718469)
