A two-dimensional bin packing-based split-and-pack approach for decomposing large three-dimensional structures into convex items

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Computer-aided Design and Applications

• Publication date

  2018-01-02

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1080/16864360.2017.1353728
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Matheuristics for the irregular bin packing problem with free rotations

  2017cited by this paper
• A constructive heuristic for the two-dimensional bin packing based on value correction

  2017cited by this paper
• Online algorithms for 2D bin packing with advice

  2016cited by this paper
• The load-balanced multi-dimensional bin-packing problem

  2016cited by this paper
• Hybrid Heuristic Algorithms for the Multiobjective Load Balancing of 2D Bin Packing Problems

  2015cited by this paper
• Improved Approximation Algorithm for Two-Dimensional Bin Packing

  2014cited by this paper
• A unified hyper-heuristic framework for solving bin packing problems

  2014cited by this paper
• Feature-aware partitions from the motorcycle graph

  2014cited by this paper
• Motorcycle graph enumeration from quadrilateral meshes for reverse engineering

  2014cited by this paper
• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem

  2014cited by this paper
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

  2013cited by this paper
• Study on the Layout Optimization of Platform Based on Simulated Annealing Algorithm

  2013cited by this paper
• Generation of bi-monotone patches from quadrilateral mesh for reverse engineering

  2013cited by this paper
• A tale of two dimensional bin packing

  2005cited by this paper
• Computing a View Frustum to Maximize an Object's Image Area

  2003cited by this paper
• Recent advances on two-dimensional bin packing problems

  2002cited by this paper
• On-line Packing and Covering Problems

  1996cited by this paper
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts

  1995cited by this paper
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems

  1995cited by this paper
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

  1987cited by this paper
• Two-Dimensional Finite Bin-Packing Algorithms

  1987cited by this paper
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

  1985cited by this paper
• On Packing Two-Dimensional Bins

  1982cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper

• No citing papers are available for this paper.