Extremal problem of area approximation
Abstract
This paper investigates the problem of optimal piecewise linear approximation of a smooth curve, in which the area of the region enclosed between the graph of the original function and the constructed interpolating polyline is minimized. This problem arises in technological processes such as laser and plasma cutting of metals, milling, additive manufacturing, and in the preparation of control programs for CNC equipment. For a quadratic parabola, the exact value of the minimum area is established, and it is shown that the optimal partition of the interval is uniform. For a cubic function, it is demonstrated that the optimal interpolation nodes are distributed non-uniformly; in the case of two internal partition points, their exact coordinates and the corresponding minimum area are obtained. The results can be applied in CAD systems for optimizing tool paths based on the criterion of minimum deviation area.
Cite
@article{arxiv.2607.24828,
title = {Extremal problem of area approximation},
author = {O. O. Pokutnyi and R. R. Salimov and M. V. Stefanchuk},
journal= {arXiv preprint arXiv:2607.24828},
year = {2026}
}