The irregular nesting problem - a new approach for nofit polygon calculation
The irregular nesting problem - a new approach for nofit polygon calculation
This paper presents a new approach for generating the nofit polygon (NFP) that is simple, intuitive and computationally efficient. The NFP has in recent years become an important tool for handling the geometric calculations for two-dimensional irregular shape nesting problems. Its value lies in reducing the computational complexity of detecting whether two polygons overlap. The proposed NFP generator is based on the novel concept of trace line segments that are derived from the interaction of the two-component polygons. The complete set of the trace line segments contain all the boundary edges of the NFP and some internal points that need to be discarded. Algorithms for deriving the trace line segments, efficiently determining those segments that form the boundary of the NFP and the identification of holes and degenerate cases are described
1235-1245
Liu, H.Y.
81be8b07-996a-4132-bcb1-2be37bc548a1
He, Y.J.
9371bf2f-adb4-4f64-bde5-bf73fd7ef86f
Bennell, J.A.
38d924bc-c870-4641-9448-1ac8dd663a30
September 2007
Liu, H.Y.
81be8b07-996a-4132-bcb1-2be37bc548a1
He, Y.J.
9371bf2f-adb4-4f64-bde5-bf73fd7ef86f
Bennell, J.A.
38d924bc-c870-4641-9448-1ac8dd663a30
Liu, H.Y., He, Y.J. and Bennell, J.A.
(2007)
The irregular nesting problem - a new approach for nofit polygon calculation.
Journal of the Operational Research Society, 58 (9), .
(doi:10.1057/palgrave.jors.2602255).
Abstract
This paper presents a new approach for generating the nofit polygon (NFP) that is simple, intuitive and computationally efficient. The NFP has in recent years become an important tool for handling the geometric calculations for two-dimensional irregular shape nesting problems. Its value lies in reducing the computational complexity of detecting whether two polygons overlap. The proposed NFP generator is based on the novel concept of trace line segments that are derived from the interaction of the two-component polygons. The complete set of the trace line segments contain all the boundary edges of the NFP and some internal points that need to be discarded. Algorithms for deriving the trace line segments, efficiently determining those segments that form the boundary of the NFP and the identification of holes and degenerate cases are described
This record has no associated files available for download.
More information
Published date: September 2007
Identifiers
Local EPrints ID: 56836
URI: http://eprints.soton.ac.uk/id/eprint/56836
ISSN: 0160-5682
PURE UUID: 60eee1e7-868d-443f-a446-ff8429c708f3
Catalogue record
Date deposited: 06 Aug 2008
Last modified: 15 Mar 2024 11:03
Export record
Altmetrics
Contributors
Author:
H.Y. Liu
Author:
Y.J. He
Author:
J.A. Bennell
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics