✦ LIBER ✦

Greedy vacancy search algorithm for packing equal circles in a square

✍ Scribed by Wenqi Huang; Tao Ye

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 305 KB
Volume: 38
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2010.07.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A better packing of ten equal circles in

A better packing of ten equal circles in a square

✍ Guy Valette 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 211 KB

New results in the packing of equal circ

New results in the packing of equal circles in a square

✍ Costas D. Maranas; Christodoulos A. Floudas; Panos M. Pardalos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Some progress in the packing of equal ci

Some progress in the packing of equal circles in a square

✍ Michael Mollard; Charles Payan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The problem of the densest packing of n equal circles in a square has been solved for n < 10 in [4, 61; and some solutions have been proposed for n > 10. In this paper we give some better packings for n = 10, 11, 13 and 14.