Skoči na glavni sadržaj

Pregledni rad

Computer-based Methods for Packaging Problems

Daniel Domović orcid id orcid.org/0000-0003-4576-7988 ; Tekstilno-tehnološki fakultet Sveučilišta u Zagrebu, Zagreb, Hrvatska
Tomislav Rolich orcid id orcid.org/0000-0003-0165-9555 ; Tekstilno-tehnološki fakultet Sveučilišta u Zagrebu, Zagreb, Hrvatska


Puni tekst: hrvatski pdf 439 Kb

str. 310-321

preuzimanja: 210

citiraj


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

Podaci na drugim jezicima: hrvatski

Posjeta: 551 *