0.Definitions and Notations 1.Density Problems for Packings and Goverings 1.1 Basic Questions and Defintions 1.2 The Least Econmical Convex Sets for Packing 1.3 The Least Economical Convex Sets for Covering 1.4 How Economical Are the Lattice Arrangemets? 1.5 Packing with Semidisks,and the Role of Symmetry 1.6 Packing Equal Dircles into Squares,Circles,Spheres 1.7 Packing Equal Circles of Squares in a Strip 1.8 The Densest Packing of Spheres 1.9 The Densest Packings of Specific Convex Bodies 1.10 Linking Packing and Covering Denstities 1.11 Sausage Problems and Catastrophes 2.Structural Packing and Covering Problems 2.1 Decomposition of Multiple Packings and Coverings 2.2 Solid and Saturated Packings and Reduced Coverings 2.3 Stable Packins and Coverings 2.4 Kissing and Neighborly Convex Bodies 2.5 Thin Packings with Many Neighbors 2.6 Permeability and Blocking Light Rays 3.Packing and Covering with Homothetic Copies 3.1 Potato Bay Problems 3.2 Covering a Convex Body with Its Homothetic Copies 3.3 Levi-Hadwiger Covering Problem and Illumination 3.4 Covering a Ball by Slabs 3.5 Point Trapping and Impassable Lattice Arrangements 4.Tilling Problems 5.Distance Problem 6.Problems on Repeated Subconfigurations 7.Incidence and Arrangement Problems 8.Problems on Points in Genral Positon 9.Graph Drawings and Geometric Graphs 10.Lattice Point Problems 11.Geometric Inequalities 12.Index
鄂公網(wǎng)安備 42010302001612號(hào) 