Densest translational lattice packing of non-convex polygons
type: Item
instance of: scholarly article
title: Densest translational lattice packing of non-convex polygons
zbMATH Open document ID: 1016.68146
DOI: 10.1016/S0925-7721(01)00051-7
author: Victor J. Milenkovic
published in: Computational Geometry
publication date: 2002-06-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1758561
zbMATH Keywords: translational lattice packing
MaRDI profile type: Publication
cites work: Multiple translational containment. I: An approximate algorithm
cites work: Computing the intersection-depth to polyhedra
cites work: Solution approaches to irregular nesting problems
cites work: Packing problems
cites work: A typology of cutting and packing problems
cites work: Double-lattice packings of convex bodies in the plane
cites work: Compaction and separation algorithms for non-convex polygons and their applications
cites work: Q4228460
cites work: Multiple translational containment. II: Exact algorithms
cites work: Q4011321
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
description: scientific article; zbMATH DE number 1758561