Notice: Undefined index: linkPowrot in C:\wwwroot\wwwroot\publikacje\publikacje.php on line 1275
Three different algorithms of the Tangent Method of contour approximation are presented and compared in the paper. Cartesian, polar and (θ, l) generalised chain coding schemes of contour representation are considered. The comparison of approximation errors introduced by each of the algorithms is performed with use of the mean square error criterion. Computational times of analysed procedures are estimated basing on a number of numerical operations. Finally, effectiveness of each of the compression schemes is considered.