Issue No. 09 - September (1989 vol. 11)

ISSN: 0162-8828

pp: 967-973

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.35499

ABSTRACT

<p>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.</p>

INDEX TERMS

2D digitised curves; computerised picture processing; adaptive reduction; piecewise linear approximation; square grid; time complexity; critical points; computational complexity; computerised picture processing

CITATION

J.F. Wang, J.Y. Lee, C.S. Fahn, "An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 11, no. , pp. 967-973, September 1989, doi:10.1109/34.35499