New approaches to circle packing in a square : with program codes
In one sense, the problem of finding the densest packing of congruent circles in a square is easy to understand: it is a matter of positioning a given number of equal circles in such a way that the circles fit fully in a square without overlapping. But on closer inspection, this problem reveals itse...
Na minha lista:
| Auteurs principaux: | , , , , , , , |
|---|---|
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
New York, NY :
Springer US
[20..].
Cham : Springer Nature |
| Edição: | 1st ed. 2007. |
| Colecção: | Springer Optimization and Its Applications
6 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
L'impression du document génère 238 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • New approaches to circle packing in a square, with program codes, by P.G. Szabó,... M.Cs. Markót,... T. Csendes,... [et al.], 2007, New York, Springer, 1 vol. (XIV-238 p.), Springer optimization and its applications, 978-0-387-45673-7 • New Approaches to Circle Packing in a Square, Texte imprimé, 9780387516363 • New approaches to circle packing in a square, with program codes, by P.G. Szabó,... M.Cs. Markót,... T. Csendes,... [et al.], 2007, New York, Springer, 1 vol. (XIV-238 p.), Springer optimization and its applications, 978-0-387-45673-7 • New Approaches to Circle Packing in a Square, Texte imprimé, 9781489988973 • New Approaches to Circle Packing in a Square, Texte imprimé, 9780387516363 • New approaches to circle packing in a square, with program codes, by P.G. Szabó,... M.Cs. Markót,... T. Csendes,... [et al.], 2007, New York, Springer, 1 vol. (XIV-238 p.), Springer optimization and its applications, 978-0-387-45673-7 • New Approaches to Circle Packing in a Square, Texte imprimé, 9781489988973 |
Sumário:
- and Problem History Problem Definitions and Formulations Bounds for the Optimum Values Approximate Circle Packings Using Optimization Methods Other Methods for Finding Approximate Circle Packings Interval Methods for Validating Optimal Solutions The First Fully Interval-based Optimization Method The Improved Version of the Interval Optimization Method Interval Methods for Verifying Structural Optimality Repeated Patterns in Circle Packings Minimal Polynomials of Point Arrangements About the Codes Used