Decomposition algorithm for geometric objects in 2D packing and cutting problems
From MaRDI portal
Publication:464977
DOI10.1007/S10559-011-9364-9zbMATH Open1306.90139OpenAlexW1997005789MaRDI QIDQ464977FDOQ464977
Authors: N. I. Gil', M. V. Zlotnik, Yu. Stoyan, T. Romanova
Publication date: 30 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-011-9364-9
Recommendations
Cites Work
- Mathematical model and efficient algorithms for object packing problem
- The geometry of nesting problems: a tutorial
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Tools of mathematical modeling of arbitrary object packing problems
- Title not available (Why is that?)
- \(\Phi\)-functions for complex 2D-objects
- \(\Phi\)-function and its basic properties
- Construction of a Φ-function for two convex polytopes
Cited In (4)
This page was built for publication: Decomposition algorithm for geometric objects in 2D packing and cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464977)