𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dense packings of congruent circles in a circle

✍ Scribed by R.L. Graham; B.D. Lubachevsky; K.J. Nurmela; P.R.J. Östergård

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
933 KB
Volume
181
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the best packings found of up to 65 circles are presented.

📜 SIMILAR VOLUMES

A polynomial time circle packing algorit
A polynomial time circle packing algorithm
✍ Bojan Mohar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Mohar, B., A polynomial time circle packing algorithm, Discrete Mathematics 117 (1993) 2577263. The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. Simultaneous circle packing representations of the map and its dual map are obtained such that any two edges dua

Circle Packings of Maps in Polynomial Ti
Circle Packings of Maps in Polynomial Time
✍ Bojan Mohar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. First, we obtain simultaneous circle packings of the map and its dual map so that, in the corresponding straight-line representations of the map and the dual, any two edges dual to each other are perpendicular