|
|
|
|
| LEADER |
04785nmm a2200445 u 4500 |
| 001 |
EB000355317 |
| 003 |
EBX01000000000000000208369 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9780387456768
|
| 100 |
1 |
|
|a Szabó, Péter Gábor
|
| 245 |
0 |
0 |
|a New Approaches to Circle Packing in a Square
|h Elektronische Ressource
|b With Program Codes
|c by Péter Gábor Szabó, Mihaly Csaba Markót, Tibor Csendes, Eckard Specht, Leocadio G. Casado, Inmaculada García
|
| 250 |
|
|
|a 1st ed. 2007
|
| 260 |
|
|
|a New York, NY
|b Springer US
|c 2007, 2007
|
| 300 |
|
|
|a XIV, 238 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Optimization
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Convex geometry
|
| 653 |
|
|
|a Mathematics / Data processing
|
| 653 |
|
|
|a Computer arithmetic and logic units
|
| 653 |
|
|
|a Mathematical Applications in Computer Science
|
| 653 |
|
|
|a Computational Science and Engineering
|
| 653 |
|
|
|a Arithmetic and Logic Structures
|
| 653 |
|
|
|a Convex and Discrete Geometry
|
| 653 |
|
|
|a Discrete geometry
|
| 653 |
|
|
|a Mathematical optimization
|
| 700 |
1 |
|
|a Markót, Mihaly Csaba
|e [author]
|
| 700 |
1 |
|
|a Csendes, Tibor
|e [author]
|
| 700 |
1 |
|
|a Specht, Eckard
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Springer Optimization and Its Applications
|
| 028 |
5 |
0 |
|a 10.1007/978-0-387-45676-8
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-0-387-45676-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 519.6
|
| 520 |
|
|
|a The emerging computational algorithms can also be helpful in other hard-to-solve optimization problems like molecule conformation. The wider scientific community has already been involved in checking the codes and has helped in having the computational proofsaccepted. Since the codes can be worked with directly, they will enable the reader to improve on them and solve problem instances that still remain challenging, or to use them as a starting point for solving related application problems. Audience This book will appeal to those interested in discrete geometrical problems and their efficient solution techniques. Operations research and optimization experts will also find it worth reading as a case study of how the utilization of the problem structure and specialities made it possible to find verified solutions of previously hopeless high-dimensional nonlinear optimization problems with nonlinear constraints
|
| 520 |
|
|
|a Such free circles (or "rattles”) mean that there exist not only a continuum of optimal solutions, but the measure of the set of optimal solutions is positive! This book summarizes results achieved in solving the circle packing problem over the past few years, providing the reader with a comprehensive view of both theoretical and computational achievements. Typically illustrations of problem solutions are shown, elegantly displaying the results obtained. Beyond the theoretically challenging character of the problem, the solution methods developed in the book also have many practical applications. Direct applications include cutting out congruent two-dimensional objects from an expensive material, or locating points within a square in such a way that the shortest distance between them is maximal. Circle packing problems are closely related to the "obnoxious facility location” problems, to the Tammes problem, and less closely related to the Kissing Number Problem.
|
| 520 |
|
|
|a 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 itself to be an interesting challenge of discrete and computational geometry with all its surprising structural forms and regularities. As the number of circles to be packed increases, solving a circle packing problem rapidly becomes rather difficult. To give an example of the difficulty of some problems, consider that in several cases there even exists a circle in an optimal packing that can be moved slightly while retaining the optimality.
|