A fast sequential method for polygonal approximation of digitized curves
Computer Vision, Graphics, and Image Processing
Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Polygonal approximations that minimize the number of inflections
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Unsupervised Clustering in Hough Space for Identification of Partially Occluded Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Topologically reliable approximation of composite Bézier curves
Computer Aided Geometric Design
Piecewise approximation of contours through scale-space selection of dominant points
IEEE Transactions on Image Processing
| Hi-index | 0.15 |
A new algorithm is presented for the piecewise linear approximation of two-dimensional digitized curves against a square grid. The algorithm utilizes an adaptive reduction procedure in two approximation phases to select the critical points of a digitized curve such that the deviation, from the digitized curve to its final approximated curve, is bounded by a uniform error tolerance. The time complexity of this algorithm is O(m/sup 2/) rather than O(n/sup 2/) on the theoretical plane. In the experiments of fixing the initial and the final processing points, the performance of the algorithm has been compared to those of three prominent other algorithms regarding the required number of critical points and the total execution time of the program. Of the four algorithms compared, the present algorithm consistently has the shortest execution time of the program, and it tends most to require as few critical points as the optimum algorithm that was tested.