SUMMARY OF THE RESULTS OF INFORMATION TECHNOLOGY DEVELOPMENT FOR OPTIMIZING VECTOR GRAPHIC OBJECT PLACEMENT ON A PLANE

Abstract

The article summarizes the results of developing an information technology for optimizing the placement of vector graphic objects within a limited area for automated cutting, contour cutting, and other manufacturing processes associated with efficient material utilization. The problem of placing arbitrarily shaped objects is formalized with consideration of workspace boundaries, allowable rotation angles, technological clearances, non-overlap constraints, and layout quality criteria. The developed technology combines SVG data preparation, discrete contour approximation, genetic optimization, clustering, caching, and parallel processing of placement variants. To reduce computational complexity, each contour together with its buffer zone is converted into a two-dimensional binary matrix, making it possible to replace complex geometric checks with comparisons of matrix masks using bitwise operations. The optimization core is implemented on the basis of a genetic algorithm in which solutions are represented as chromosomes, while new generations are formed using elitist selection, selection, crossover, mutation, and clustering. The technology was implemented as a desktop software tool developed in Kotlin on the JVM platform using Java Swing, which supports SVG file loading, parameter configuration, optimization execution, visualization, and layout saving. Experimental studies were conducted using synthetic and practically oriented sets of vector objects. The relationship between the discretization cell size, layout accuracy, and computation time was established. In the example involving the placement of paper model parts, the number of required A4 sheets was reduced from 10 to 6, corresponding to a 40% reduction. The obtained results confirm the effectiveness of the technology for automated cutting, contour cutting, and other vector object placement tasks.