SearcharxivSearch

arXiv subjects

M. V. Stefanchuk

Publications and source records attributed to M. V. Stefanchuk.

3 recordsLinked to original sources

Extremal problem of area approximation

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.

math.OC

Generalizations of the shadow problem

We received a solution of the shadow problem in n-dimensional Euclidean space for a family of sets, constructing from any convex domain having nonempty interior with the help of parallel translations and homotheties. We find a number of balls with centers on the sphere, sufficient for giving a shadow in n-dimensional complex (hypercomplex) space.

math.MG

Extremal elements in hypercomplex space

Extremal elements and a h-hull of sets in the n-dimensional hypercomplex space are investigated. Introduced a class of H-quasiconvex sets including strongly hypercomplex convex sets and being closed with respect to intersections.

math.MG