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...
| Otros Autores: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
New York :
Springer
c2007.
|
| Edición: | 1st ed. 2007. |
| Colección: | Springer optimization and its applications ;
v. 6. |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009461482306719 |
Tabla de Contenidos:
- 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.
