Article thumbnail
Location of Repository

A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums

By Julia A. Bennell and Xiang Song

Abstract

The nofit polygon is a powerful and effective tool for handling the geometric requirements of solution approaches to irregular cutting and packing problems. Although the concept was first described in 1966, it was not until the early 90s that the general trend of research moved away from direct trigonometry to favour the nofit polygon. Since<br/>then, the ability to calculate the nofit polygon has practically become a pre-requisite for researching irregular packing problems. However, realisation of this concept in the form of a robust algorithm is a highly challenging task with few instructive approaches published. In this paper, a procedure using the mathematical concept of Minkowski sums for the calculation of the nofit polygon is presented. The described procedure is more robust than other approaches using Minkowski Sum knowledge and includes details of the removal of internal edges to find holes, slits and lock and key positions. The<br/>procedure is tested on benchmark data sets and gives examples of complicated cases. In addition the paper includes a description of how the procedure is modified in order to realise the inner-fit polygon

Topics: HD28
Publisher: University of Southampton
Year: 2005
OAI identifier: oai:eprints.soton.ac.uk:36850
Provided by: e-Prints Soton
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

Suggested articles

Citations

  1. (1993). A unified computational framework for Minkowski operations.
  2. (1993). Algorithms for nesting problems,
  3. (1991). An algebra of polygons through the notion of negative shapes.
  4. (1996). An algorithm to compute the Minkowski sum outer face of two simple polygons,
  5. (1999). An efficient algorithm for the regular W1 packing of polygons in the infinite plane,
  6. (2005). An improved typology of cutting and packing problems, working paper,
  7. (1995). Compaction and separation algorithms for non-convex polygons and their applications,
  8. (2005). European working group on cutting and packing.
  9. (1998). Incorporating problem specific knowledge into a local search framework for the irregular shape packing problem,
  10. (1981). Mathematical Treatments of Some Apparel Marking and Cutting Problems,
  11. (1976). Nesting two dimensional shapes in rectangular modules,
  12. (1984). Optimization in computer aided pattern packing,
  13. (2001). Phie functions for primary 2D-objects,
  14. (2002). Polygon decomposition for efficient construction of Minkowski sums,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.