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. 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. 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.
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.
249 pages; ISBN 9780387456768
, or download in
Title: New Approaches to Circle Packing in a Square
Author: Péter Gábor Szabó; Mihaly Csaba Markót; Tibor Csendes; Eckard Specht; Leocadio G. Casado; Inmaculada García
CompTIA Network+ Study Guide 2015 US$ 49.99 960 pages
New Digital Storytelling, The: Creating Narratives with New Media 2011 US$ 49.00 296 pages
CompTIA A+ Certification All-in-One Exam Guide, 8th Edition (Exams 220-801 & 220-802) 2012 US$ 60.00 1664 pages
Mastering HTML5 Forms 2013 US$ 17.99 148 pages
- Academic > Mathematics > Geometry. Trigonometry.Topology > Convex sets
- Academic > Mathematics > Geometry. Trigonometry.Topology > Discrete geometry
- Computers > Programming > Algorithms
- Mathematics > Geometry
- Mathematics > Applied
- Mathematics > Linear Programming
- Computers > Logic Design
- Computers > Data Modeling & Design
- Computers > Data Processing
- Computers > Mathematical & Statistical Software