Splitting into polygonal primitives sweep a 3D object's

Authors

  • Sergey Anatolevich Zykin
  • Aleksandr Anatolevich Petrenko
  • Yuliya Ilyasovna Valiahmetova UGATU

Keywords:

cutting; polygon unfolding; geometric coverage; greedy algorithm; first fit algorithm; probabilistic algorithm.

Abstract

The problem of saving resources in production remains relevant for many areas of human activity. When making blanks, it is necessary to solve the problem of optimal cutting. To solve this problem, one of the most profitable methods of cutting material is selected to reduce the amount of waste when cutting blanks. Geometric coverage problems are often one of the stages in solving larger discrete optimization problems. It is necessary to position certain objects on the surface of another, usually larger object so that the area of the object to be covered is completely filled with minimization of overlapping of the covering objects. The results obtained allow us to see the rational coverage map obtained by three algorithms. The practical significance of the work is due to a significant increase in the role of rational coating of the material in connection with the expediency of minimizing waste in production.  

Published

2020-28-12

Issue

Section

INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT