Abstract
Pattern marking is the allocation of garment patterns on the cloth roll minimizing the fabric loss, and thus very important for the cost reduction in garment manufacturing industries. But automatic marking is very difficult because it is a non‐deterministic in polynomial time problem. Most previous pattern marking methods needed collision detection routine to lay out patterns without interfering each other, which was the bottle neck of nesting speed. In this study, rectilinear polygon approximation technique was used to reduce the overall calculation time because the garment patterns are usually in non‐convex shape that can effectively be approximated by rectangles. Additionally, we adapted stochastic simulated annealing to search the optimal pattern marking.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Clothing Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.