A method of optimal lattice packing of congruent oriented polygons in the plane

DOI10.1016/S0377-2217(99)00115-0zbMath0990.90103MaRDI QIDQ1576353

V. N. Patsuk, Yu. G. Stoyan

Publication date: 14 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

packingoptimization problemlattice packing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

An improved typology of cutting and packing problems ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Tools of mathematical modeling of arbitrary object packing problems ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm

Cites Work

• Double-lattice packings of convex bodies in the plane
• Compaction and separation algorithms for non-convex polygons and their applications
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• A typology of cutting and packing problems
• Packing and covering the plane with translates of a convex polygon
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item