DISCRETE APPROXIMATION IN THE PROBLEMS OF PLACING VECTOR GRAPHIC OBJECTS ON A PLANE
This article presents a new approach to finding possible placements of vector objects on a plane using discrete approximation. The proposed method significantly reduces the computational complexity of the problem by converting vector images into a discrete form represented by a pixel grid. This enables faster intersection checks between objects through the analysis of occupied grid elements, thus simplifying the process of modeling graphic placement.