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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Szabó, Péter Gábor (Autor), Markót, Mihaly Csaba (Autor), Csendes, Tibor (Autor), Specht, Eckard (Autor), Casado, Leocadio G. (Autor), García, Inmaculada (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Springer Optimization and Its Applications, 6
Temas:
Mathematical optimization.
Computer science-Mathematics.
Convex geometry .
Discrete geometry.
Computer arithmetic and logic units.
Mathematics-Data processing.
Optimization.
Mathematical Applications in Computer Science.
Convex and Discrete Geometry.
Arithmetic and Logic Structures.
Computational Science and Engineering.
Acceso en línea:Texto Completo
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.

Ejemplares similares