hrcak mascot   Srce   HID

Pregledni rad

Computer-based Methods for Packaging Problems

Daniel Domović   ORCID icon orcid.org/0000-0003-4576-7988 ; Faculty of Textile Technology, University of Zagreb, Zagreb, Croatia
Tomislav Rolich   ORCID icon orcid.org/0000-0003-0165-9555 ; Faculty of Textile Technology, University of Zagreb, Zagreb, Croatia

Puni tekst: hrvatski, pdf (439 KB) str. 310-321 preuzimanja: 130* citiraj
APA 6th Edition
Domović, D. i Rolich, T. (2015). Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika. Tekstil, 64 (9-10), 310-321. Preuzeto s https://hrcak.srce.hr/166505
MLA 8th Edition
Domović, Daniel i Tomislav Rolich. "Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika." Tekstil, vol. 64, br. 9-10, 2015, str. 310-321. https://hrcak.srce.hr/166505. Citirano 31.05.2020.
Chicago 17th Edition
Domović, Daniel i Tomislav Rolich. "Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika." Tekstil 64, br. 9-10 (2015): 310-321. https://hrcak.srce.hr/166505
Harvard
Domović, D., i Rolich, T. (2015). 'Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika', Tekstil, 64(9-10), str. 310-321. Preuzeto s: https://hrcak.srce.hr/166505 (Datum pristupa: 31.05.2020.)
Vancouver
Domović D, Rolich T. Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika. Tekstil [Internet]. 2015 [pristupljeno 31.05.2020.];64(9-10):310-321. Dostupno na: https://hrcak.srce.hr/166505
IEEE
D. Domović i T. Rolich, "Računalne metode prikladne za rješavanje problema pakiranja pri uklapanju krojnih slika", Tekstil, vol.64, br. 9-10, str. 310-321, 2015. [Online]. Dostupno na: https://hrcak.srce.hr/166505. [Citirano: 31.05.2020.]

Sažetak
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.

Ključne riječi
packing problem; genetic algorithm; overlap detection; automatic marker making; lay plan

Hrčak ID: 166505

URI
https://hrcak.srce.hr/166505

[hrvatski]

Posjeta: 260 *