We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika.
- Authors
Domović, Daniel; Rolich, Tomislav
- Abstract
In this paper an overview of algorithms for automated marker making problem has been presented. This problem has been a field of interest in computer science within the scope of packing problem algorithms. Packing problem is a problem in which a set of items needs to be placed within the boundaries of a container without overlapping. The goal is to minimize the waste area between polygons, i.e. to reduce the area of a container. Considering the fact packing problems arise in various industries, in this paper an overview of packing problems and its taxonomy is presented, alongside an overview of overlapping detection methods such as raster method, no-fit polygon, direct trigonometry, D-functions and constraint graphs. Also, some of the existing problem solving approaches have been described.
- Publication
Tekstil: Journal of Textile & Clothing Technology, 2015, Vol 64, Issue 9/10, p310
- ISSN
0492-5882
- Publication type
Academic Journal