Contour compression using trapezoid method

An efficient algorithm for the contour data approximation and compression is presented and discussed in this paper. The contour inputs are represented in Cartesian coordinates. The contour input is processed and some of the vertices are chosen as the vertices of the contour polygon. We also discuss the main idea of the analysed approach and we will compare it with the Ramer and Triangle methods of contour approximation. The single step parallel contour extraction (SSPCE) method will be used in this work. For comparison, we are going to use the mean square error and signal-to-noise ratio criterions. Computational time of analysed method is estimated depending on a number of numerical operations. This paper shows that the simplicity and the small number of operations are the main advantages of the proposed algorithm.