Packing and covering the plane with translates of a convex polygon

DOI10.1016/0196-6774(90)90010-CMaRDI QIDQ3201801zbMATH OpenOpenAlexWikidataFDO

Authors David M. Mount, Ruth Silverman

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)

Recommendations

• scientific article; zbMATH DE number 66687
• scientific article; zbMATH DE number 1786500
• Densest translational lattice packing of non-convex polygons
• Packing and covering with centrally symmetric convex disks
• scientific article; zbMATH DE number 1331106

Cited in

(11)

• scientific article; zbMATH DE number 1194276 (Why is no real title available?)
• Covering the plane with translates of a triangle
• Geometric Knapsack problems
• scientific article; zbMATH DE number 66687 (Why is no real title available?)
• Entropic Trust Region for Densest Crystallographic Symmetry Group Packings
• Densest translational lattice packing of non-convex polygons
• Packing, covering and tiling in two-dimensional spaces
• Translational packing of arbitrary polytopes
• Simultaneous packing and covering in the Euclidean plane
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201801)