This book provides an in-depth, state-of-the-art discussion of the theory of finite packings and coverings by convex bodies. It contains various new results and arguments, collects other key data scattered about the literature, and provides a comprehensive treatment of problems whose interplay was n
Finite Packing and Covering
โ Scribed by Kรกroly Bรถrรถczky Jr
- Publisher
- Cambridge University Press
- Year
- 2004
- Tongue
- English
- Leaves
- 399
- Series
- Cambridge Tracts in Mathematics no. 154; Cambridge tracts in mathematics no. 154
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
This book provides an in-depth, state-of-the-art discussion of the theory of finite packings and coverings by convex bodies. It contains various new results and arguments, collects other key data scattered about the literature, and provides a comprehensive treatment of problems whose interplay was not clearly understood prior to this text. Arrangements of congruent convex bodies in Euclidean space are covered, and the density of finite packing and covering by balls in Euclidean, spherical and hyperbolic spaces is considered
โฆ Table of Contents
Content: Preface
Notation
Part I. Arrangements in Dimension Two: 1. Congruent domains in the Euclidean plane
2. Translative arrangements
3. Parametric density
4. Packings of circular discs
5. Coverings by circular discs
Part II. Arrangements in Higher Dimensions: 6. Packings and coverings by spherical balls
7. Congruent convex bodies
8. Packings and coverings by unit balls
9. Translative arrangements
10. Parametric density
Appendix
Bibliography
Index.
โฆ Subjects
Combinatorial packing and covering
๐ SIMILAR VOLUMES
Bรถrรถczky (Hungarian Academy of Sciences) builds from the foundation set by Tรณth (Regular Figures) and Rogers (Packing and Covering) by describing arrangements of congruent convex bodies that either form a packing in a convex container or cover a convex shape, covering arrangements in dimension two (
This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural line