Translational packing of arbitrary polytopes

DOI10.1016/j.comgeo.2008.06.003zbMath1178.90286OpenAlexW2126733148MaRDI QIDQ1005325

Jens Egeblad, Marcus Brazil, Benny K. Nielsen

Publication date: 9 March 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.06.003

zbMATH Keywords

heuristicspackingguided local searchpacking polytopesmaximizing overlapminimizing overlapstrip-packingtranslational packing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (15)

Modeling close packing of 3D objects ⋮ An overview on the use of operations research in additive manufacturing ⋮ Bundling three convex polygons to minimize area or perimeter ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Configuration space of geometric objects ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Packing of concave polyhedra with continuous rotations using nonlinear optimisation ⋮ Packing different cuboids with rotations and spheres into a cuboid ⋮ Mathematical modeling of the interaction of non-oriented convex polytopes ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container ⋮ Placement of two- and three-dimensional irregular shapes for inertia moment and balance ⋮ Heuristics for container loading of furniture ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ Constraints in container loading -- a state-of-the-art review

Uses Software

• CGAL

Cites Work

• Unnamed Item
• Maximizing the overlap of two planar convex sets under rigid motions
• Solution approaches to irregular nesting problems
• Optimal packing and covering in the plane are NP-complete
• Computing the maximum overlap of two convex polygons under translations
• A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout.
• Guided local search and its application to the traveling salesman problem
• Solving container loading problems by block arrangement
• Heuristic algorithms for the three-dimensional bin packing problem
• The nesting problem in the leather manufacturing industry
• Vertical decompositions for triangles in 3-space
• A moment based metric for 2-D and 3-D packing
• Finding a guard that sees most and a shop that sells most
• Fast neighborhood search for two- and three-dimensional nesting problems
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Polytope Volume Computation
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Packing of convex polytopes into a parallelepiped

This page was built for publication: Translational packing of arbitrary polytopes