Algorithm Of Generalization Based On The Minimum Quadrates Method

Abstract

The article proposes an algorithm based on the least squares method for solving problems of simplifying and generalizing many lines. The proposed approach, unlike classical polyline simplification algorithms, does not require the location of the generated nodes at the points of the initial polyline, which increases the generality of the algorithm and improves the accuracy of geometric approximation. It was shown that the algorithm can be used for flexible simplification of contours at different accuracy levels, reduction of noise effects, and optimization of the number of nodes. The research results confirm that the method can be effectively applied in the fields of cartography, computer graphics, and image vectorization.