Packing, covering and tiling in two-dimensional spaces

2013/12/17 by Chuanming Zong · 2 citations
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding (social sciences) #Computational Geometry and Mesh Generation #Computer science #Epistemology #Focus (optics) #Gauss #Key (lock) #Mathematics #Optimization and Packing Problems #Simple (philosophy) #Subject (documents) #Theoretical computer science

paper · pdf · doi:10.1016/j.exmath.2013.12.002

openalex publication_date 2013/12/17 · crossref created 2013/12/17 · crossref issued 2014/01/01 · crossref published 2014/01/01 · crossref published-print 2014/01/01 · crossref deposited 2023/07/09 · openalex created_date 2025/10/10 · crossref indexed 2026/03/11 · openalex updated_date 2026/08/01

Citations

• Finite Packing and Covering
• Convex and Discrete Geometry
• Inefficiency in packing squares with unit squares
• Tilings and Patterns.
• Proving Theorems by Pattern Recognition - II
• Metallic Phase with Long-Range Orientational Order and No Translational Symmetry
• Crystallography and the penrose pattern
• The undecidability of the domino problem
• On packing squares with equal squares
• Equilateral convex pentagons which tile the plane
• Undecidability and nonperiodicity for tilings of the plane
• The Strong Thirteen Spheres Problem
• New upper bounds for kissing numbers from semidefinite programming
• Mathematical problems
• On periodic and non-periodic space fillings ofEmobtained by projection

Cited by

• Multiple Lattice Tilings in Euclidean Spaces
• Fundamental polygon [wikipedia]