Packing and covering the plane with translates of a convex polygon

DOI10.1016/0196-6774(90)90010-CzbMath0715.68089OpenAlexW2046459216WikidataQ105988247 ScholiaQ105988247MaRDI QIDQ3201801

Ruth Silverman, David M. Mount

Publication date: 1990

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90010-c

zbMATH Keywords

packing and covering problemsdensest lattice packingsparsest lattice covering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Entropic Trust Region for Densest Crystallographic Symmetry Group Packings ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ Geometric Knapsack problems ⋮ A method of optimal lattice packing of congruent oriented polygons in the plane

This page was built for publication: Packing and covering the plane with translates of a convex polygon