Circle covering representation for nesting problems with continuous rotations

dc.contributor.author Pedro Filipe Rocha en
dc.contributor.author Rui Pedro Rodrigues en
dc.contributor.author Gomes,AM en
dc.contributor.author Toledo,FMB en
dc.contributor.author Andretta,M en
dc.date.accessioned 2018-01-17T18:34:46Z
dc.date.available 2018-01-17T18:34:46Z
dc.date.issued 2014 en
dc.description.abstract This paper analyses distinct methods to represent a polygon through circle covering, which satisfy specific requirements, that impact primarily the feasibility and the quality of the layout of final solution. The trade-off between the quality of the polygonal representation and its derived number of circles is also discussed, showing the impact on the resolution of the problem, in terms of computational efficiency. The approach used to tackle the Nesting problem in strip packing uses a Non-Linear Programming model. Addressing these problems allows to tackle real world problems with continuous rotations. © IFAC. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/6809
dc.language eng en
dc.relation 5579 en
dc.relation 5336 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Circle covering representation for nesting problems with continuous rotations en
dc.type conferenceObject en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
P-00G-5KG.pdf
Size:
606.23 KB
Format:
Adobe Portable Document Format
Description: