SUBDIVISION OF THE OBJECT INTO SOLID POLYGONS AND ITS APPLIED AND ECONOMIC ASPECTS
Vardan Surenovich Mkrttchian, Narek REVAZYAN, Vigen KHACHATRYAN · ALTERNATIVE · 2023
In this article, we have studied an efficient algorithm by which we can efficiently divide a geometric object into convex components.Algorithms for dividing an object into convex polygons are among the main tools in computer graphics, robotics, and machine vision. These algorithms divide complex objects into simpler subsets consisting of convex polygons, which makes it possible to simplify their processing, analysis and visualization.Convex polygons have many advantages over more complex objects. First, they are easily described mathematically and can easily be stored in computer memory. Second, they have simple two-dimensional properties, which allows us to quickly determine their position in space. Third, convex polygons are easily sorted and processed using standard computer graphics algorithms.The described algorithm moves along all the internal angles of the object and checks whether that internal angle is greater than 180°, if so, divides the object by the continuation of the side forming that vertex. The advantage of our developed algorithm is the optimal partitioning of the object by dividing it into as few convex polygons as possible. And the shortcoming of the algorithm is its complexity.