About this eTextbook
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.
Publication details
- Author: Péter Gábor Szabó; Mihaly Csaba Markót; Tibor Csendes; Eckard Specht; Leocadio G. Casado; Inmaculada
- Publisher: Springer
- eText ISBN: 9780387456768, 0387456767
- Print ISBN: 9780387456737, 0387456732
What you receive
- A licensed digital edition of this title, supplied as PDF or EPUB. The format is set by the publisher, so email us the ISBN before ordering and we will confirm which one it is.
- Delivered to the email address on your order as a secure download link, usually within minutes and always within 24 hours of payment.
- Download links do not expire and there is no cap on re-downloads. Readable on any computer, tablet or phone, online or offline.
- This is a digital edition. Nothing is printed, packed or posted, and there is no delivery charge.


