An improved method for calculating the no-fit polygon

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Computers & Operations Research

• Publication date

  2006-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2004.11.005
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon

  2001influential reference
• Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygon

  2000influential reference
• Computational Geometry in C by Joseph O'Rourke

  1998cited by this paper
• Computational Geometry in C.

  1995cited by this paper
• An algebra of polygons through the notion of negative shapes

  1991cited by this paper
• Finding the Upper Envelope of n Line Segments in O(n log n) Time

  1989cited by this paper
• Optimization in computer-aided pattern packing (marking, envelopes)

  1984cited by this paper

• Spatial nesting strategy for non-stacked additive manufacturing

  2025cites this paper
• A parallel branch-and-bound-and-prune algorithm for irregular strip packing with discrete rotations

  2025cites this paper
• Optimizing Two-Dimensional Irregular Packing: A Hybrid Approach of Genetic Algorithm and Linear Programming

  2023cites this paper
• A hierarchical hyper-heuristic for the bin packing problem

  2022cites this paper
• Two-dimensional irregular packing problems: A review

  2022cites this paper
• Improved Sliding Algorithm for Generating No-Fit Polygon in the 2D Irregular Packing Problem

  2022cites this paper
• Sequence Transfer-Based Particle Swarm Optimization Algorithm for Irregular Packing Problems

  2021cites this paper
• Automatic layout of 2D free-form shapes based on geometric similarity feature searching and fuzzy matching

  2020cites this paper
• Robust NFP generation for Nesting problems

  2019cites this paper
• Free-form contour packing based on material grid approximation and lowest-gravity-center methods

  2015cites this paper
• Nesting Problems and Steiner Tree Problems

  2015cites this paper
• Optimization methods for nesting problems

  2013cites this paper
• Collision free region determination by modified polygonal Boolean operations

  2013cites this paper
• MODELADO Y SOLUCIÓN DEL PROBLEMA DEL CORTE IRREGULAR: Aplicación en la Industria del cuero Colombiana

  2011cites this paper
• Optimal positioning of irregular shapes in stamping die strip

  2011cites this paper
• Regarding an alternative method for translational single-item containment

  2011cites this paper
• MATHEMATICAL ENGINEERING TECHNICAL REPORTS Solving the Irregular Strip Packing Problem via Guided Local Search for Overlap Minimization

  2008cites this paper
• A More Efficient Method for Clustering Sheet Metal Shapes

  2007cites this paper
• Two-dimensional Minkowski sum optimization of ganged stamping blank layouts for use on pre-cut sheet metal for convex and concave parts

  2007cites this paper
• Nesting of complex sheet metal parts

  2007cites this paper
• An effective modeling of single cores prostheses using geometric techniques

  2004cites this paper