Packing, covering and tiling in two-dimensional spaces

DOI10.1016/j.exmath.2013.12.002zbMath1307.52012OpenAlexW2058738901WikidataQ57256993 ScholiaQ57256993MaRDI QIDQ472930

Chuan Ming Zong

Publication date: 20 November 2014

Published in: Expositiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.exmath.2013.12.002

zbMATH Keywords

latticemetric spacespherical codequasicrystalbin packingApollonian circle packingSteiner ratioPenrose tilingArchimedean tilingTammes problem

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice packing and covering (number-theoretic aspects) (11H31) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Quasicrystals and aperiodic tilings in discrete geometry (52C23) Circle packings and discrete conformal geometry (52C26)

Related Items

Covering the plane by a sequence of circular disks with a constraint, Parallel packing of triangles with squares, New dense superball packings in three dimensions, Leaves on the line and in the plane, Lower Bounds on Lattice Covering Densities of Simplices, Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices, Nondispersal and Density Properties of Infinite Packings, On parallel packing and covering of squares and cubes, On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types, Characterization of the Two-Dimensional Fivefold Translative Tiles, Multiple Lattice Tilings in Euclidean Spaces

Uses Software

• CirclePack

Cites Work

• From deep holes to free planes
• Research Problems in Discrete Geometry
• Packing and covering the plane with translates of a convex polygon
• The Problem of the Thirteen Spheres
• Multiple covering of the plane by circles
• Mehrfache gitterförmige Kreislagerungen in der Ebene
• On the Lattice Constant of a Symmetric Convex Domain
• Multiple Lattice Packings of Symmetric Convex Domains in the Plane
• Some generalized Penrose patterns from projections ofn-dimensional lattices
• New upper bounds for kissing numbers from semidefinite programming
• The densest packing of equal circles on a sphere
• On periodic and non-periodic space fillings ofE^mobtained by projection
• On the densest packing of convex discs
• The closest packing of equal circles on a sphere
• Two-Dimensional Finite Bin-Packing Algorithms
• Note to a paper of Bambah, Rogers and Zassenhaus
• Covering the Plane with Congruent Copies of a Convex Body
• A Separator Theorem for Planar Graphs
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Tilings with congruent tiles
• Packing and covering with convex discs
• On Packing Two-Dimensional Bins
• Covering and packing properties of bounded sequences of convex sets
• Covering a sphere by equal circles, and the rigidity of its graph
• Optimization and the Geometry of Numbers: Packing and Covering
• Multiple Lattice Covering of Space
• Multiple packing and covering of the plane with circles
• The eighty-one types of isohedral tilings in the plane
• The Ninety-One Types of Isogonal Tilings in the Plane
• Densest Packings of Congruent Circles in an Equilateral Triangle
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Exponential Sums and Lattice Points III
• Universal container for packing rectangles
• An ellipsoid packing in E ³ of unexpected high density
• Thin non‐lattice covering with an affine image of a strictly convex body
• Counting problems in Apollonian packings
• Convex and Discrete Geometry
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• On coverings with convex domains
• The least dense lattice packing of two‐dimensional convex bodies
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Mysteries in Packing Regular Tetrahedra
• On a Geometric Extremum Problem
• The Densest Packing of 9 Circles in a Square
• Some packing and covering theorems
• Steiner Minimal Trees
• On Paving the Plane
• On packing of squares and cubes
• Über Unterdeckungen der Ebene durch Kreise.
• Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
• The strong thirteen spheres problem
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
• Average-case analysis of cutting and packing in two dimensions
• Recent advances on two-dimensional bin packing problems
• Überdeckungen der Kugel mit höchstens acht Kreisen
• The closest packing of convex two-dimensional domains, corrigendum
• An inequality in the geometry of numbers
• On the densest lattice 8-packing in the plane
• Covering the plane with translates of a triangle
• The convergence of circle packings to the Riemann mapping
• Double-lattice packings of convex bodies in the plane
• Packing equal squares into a large square
• Packing convex bodies in the plane with density greater than 3/4
• Equilateral convex pentagons which tile the plane
• Über einige dünnste Kreisüberdeckungen konvexer Bereiche durch endliche Anzahl von kongruenten Kreisen
• Covering the sphere with 11 equal circles
• The 37 combinatorial types of minimal, non-transitive, equivariant tilings of the Euclidean plane
• Finite coverings by translates of centrally symmetric convex domains
• A method for finding the densest lattice k-fold packing of disks
• On tilings of the plane
• Finite point-sets on S 2 with minimum distance as large as possible
• Die dichteste Packung von 14 Kreisen in einem Quadrat. (On the densest packing of fourteen circles in a square)
• Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)
• Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon
• Arrangement of 24 points on a sphere
• Proof of Minkowski's conjecture concerning the critical determinant of the region \(|x|^ p+|y|^ p<1\) for \(5\leq p\leq 6\)
• Combinatorial and metric theory of planigons
• Application of a computer to the proof of a conjecture of Minkowski in the geometry of numbers
• A variational principle for circle packings.
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• Unsolved problems in geometry
• Aperiodic tiles
• Unterdeckung der Ebene durch inkongruente Kreise
• On packing squares with equal squares
• Inefficiency in packing squares with unit squares
• Isohedral tilings of the plane by polygons
• Remarks on the closest packing of convex discs
• Covering the plane with copies of a convex disk
• The densest packing of 19 congruent circles in a circle
• Densest packings of equal circles in a square
• Densest packings of eleven congruent circles in a circle
• Optimal packings of eleven equal circles in an equilateral triangle
• Mean projections and finite packings of convex bodies
• Covering the plane with congruent copies of a convex disk
• Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
• The Steiner ratio
• Packing of equal disks in an equilateral triangle: On a conjecture of Erdős-Oler
• Packing up to 50 equal circles in a square
• Covering a rectangle with equal circles
• Improved coverings of a square with six and eight equal circles
• Dense packings of congruent circles in a circle
• Patterns and structures in disk packings
• Apollonian circle packings: Number theory
• The densest packing of 13 congruent circles in a circle
• Covering the plane with fat ellipses without non-crossing assumption
• Finite packing and covering by congruent convex domains
• Some densest two-size disc packings in the plane
• The densest packing of 12 congruent circles in a circle
• Improving dense packings of equal disks in a square
• Simultaneous packing and covering in the Euclidean plane
• Packings of unequal circles in a convex set
• Packing equal circles in a square: A deterministic global optimization approach
• Minimum Steiner trees in normed planes
• On a conjecture of Croft, Falconer and Guy on finite packings
• Sphere packings. (Edited by John Talbot)
• Approximation algorithm for the oriented two-dimensional bin packing problem
• More optimal packings of equal circles in a square
• An inequality linking packing and covering densities of plane convex bodies
• Three-dimensional analogs of the planar Penrose tilings and quasicrystals
• Über einige Kreisüberdeckungen
• Local rules for multi-dimensional quasicrystals
• The thirteen spheres: a new proof
• On the lower bound of packing density for convex bodies in the plane
• Densest packings of typical convex sets are not lattice-like
• A tight lower bound for the Steiner ratio in Minkowski planes
• New results in the packing of equal circles in a square
• Covering a square by equal circles
• Repeated patterns of dense packings of equal disks in a square
• Covering a rectangle with six and seven circles
• Optimal packing of 28 equal circles in a unit square -- the first reliable solution
• The simultaneous packing and covering constants in the plane
• Covering with fat convex discs
• The kissing problem in three dimensions
• On integral Apollonian circle packings
• Dichteste Packung inkongruenter Kreise
• Undecidability and nonperiodicity for tilings of the plane
• On tightest packings in the Minkowski plane
• Lattice double coverings in the plane
• Lattice double packings in the plane
• Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems
• Ausfüllung und Überdeckung konvexer Körper durch konvexe Körper
• Über dichteste Kreislagerung und dünnste Kreisüberdeckung
• Minkowski's conjectures on critical lattices in the metric \((|\xi|^p + |\eta|^p)^{1/p}\)
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• Das Problem der dreizehn Kugeln
• Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
• The undecidability of the domino problem
• Geometric Extremum Problems
• ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
• Simultaneous Packing and Covering in Euclidean Space
• ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE
• Covering the plane by convex discs
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
• Multiple Packing of Circles in the Plane
• Note on a Conjecture By Minkowski
• On the Least Number of Unit Circles Which Can Cover a Square
• A Note on Coverings and Packings
• Sur la densité des réseaux de domaines convexes
• A Compactness Theorem For Affine Equivalence-Classes of Convex Regions
• Covering the Plane with Convex Sets
• Minkowski's Conjectures on the Critical Lattices of the Region |x | ^p +|y | ^p ⩽ 1 (I)
• Minkowski's Conjectures on the Critical Lattices of the Region |x | ^p +|y | ^p ⩽1
• On minimum circumscribed polygons
• Inequalities between lattice packing and covering densities of centrally symmetric plane convex bodies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item