Densest translational lattice packing of non-convex polygons
From MaRDI portal
Publication:1602949
DOI10.1016/S0925-7721(01)00051-7zbMath1016.68146MaRDI QIDQ1602949
Publication date: 24 June 2002
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (3)
AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ A fully general, exact algorithm for nesting irregular shapes
Cites Work
- Double-lattice packings of convex bodies in the plane
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Packing problems
- Multiple translational containment. II: Exact algorithms
- Multiple translational containment. I: An approximate algorithm
- A typology of cutting and packing problems
- Computing the intersection-depth to polyhedra
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Unnamed Item
- Unnamed Item
This page was built for publication: Densest translational lattice packing of non-convex polygons
