Nake, FriederHagemann, RalfRalfHagemann2020-03-092020-03-092012-06-08https://media.suub.uni-bremen.de/handle/elib/508The leather processing industry requires considerable amounts of leather. The desire from an economic perspective is, that the leather waste is small. In small and medium-sized companies, optimizations are done from people by hand. The people try to place cutting parts on a leather skin, that the total of leather waste is small and they are arriving this with their experience. Larger leather processing companies are using computer-based optimization methods / algorithms (nesting algorithms) for leather cutting and cnc machines for optimization the cutting prozess. With this work, a new nesting algorithm for leather cutting optimization will be shown. The nesting algorithm is inspired by Human thought and action. The calculation and consideration of C-obstacle polygons have is an elementary component. By using enhanced methods for calculating polygon-union and polygon-difference it can be shown, that templates can be placed optimized on C-obstacle polygons with zero surfaces. Through a comprehensive analysis on the templates forms, the relative (the design) and absolute template size is shown, also that the approach and the evaluation of templates a fundamental part in nesting algorithms is.deinfo:eu-repo/semantics/openAccessNestingC-obstacleMinkowskizero surfacescutting optimization516Dissertationurn:nbn:de:gbv:46-00103263-14