Hostname: page-component-8448b6f56d-gtxcr Total loading time: 0 Render date: 2024-04-20T04:23:54.561Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotic Behavior of Optimal Circle Packings in a Square

Published online by Cambridge University Press:  20 November 2018

Kari J. Nurmela ,
Patric R. J. Östergård  and
Rainer aus dem Spring
Kari J. Nurmela
Affiliation:
Department of Computer Science and Engineering Helsinki University of Technology 02015 HUT Finland, email: Kari.Nurmela@hut.fi
Patric R. J. Östergård
Affiliation:
Department of Computer Science and Engineering Helsinki University of Technology 02015 HUT Finland, email: Patric.Ostergard@hut.fi
Rainer aus dem Spring
Affiliation:
BERA Softwaretechnik GmbH 40699 Erkrath Germany, email: Rainer.adS.BERA GmbH@t-online.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A lower bound on the number of points that can be placed in a square of side $\sigma$ such that no two points are within unit distance from each other is proven. The result is constructive, and the series of packings obtained contains many conjecturally optimal packings.

Keywords

52C15asymptotic boundcircle packing
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 42 , Issue 3 , 01 September 1999 , pp. 380 - 385
Copyright
Copyright © Canadian Mathematical Society 1999

References

[1] Croft, H. T., Falconer, K. J. and Guy, R. K., Unsolved Problems in Geometry. Springer-Verlag, New York, 1991.Google Scholar
[2] Folkman, J. H. and Graham, R. L., A packing inequality for compact convex subsets of the plane. Canad.Math. Bull. 12 (1969), 745–752.Google Scholar
[3] Graham, R. L. and Lubachevsky, B. D., Repeated patterns of dense packings of equal disks in a square. Electron. J. Combin. 3(1996), R16, 17 pp. (electronic).Google Scholar
[4] Kershner, R., The number of circles covering a set. Amer. J. Math. 61 (1939), 665–671.Google Scholar
[5] Niven, I., Zuckerman, H. S. and Montgomery, H. L., An Introduction to the Theory of Numbers. 5th ed., Wiley, New York, 1991.Google Scholar
[6] Nurmela, K. J. and ¨Osterg°ard, P. R. J., Packing up to 50 equal circles in a square. Discrete Comput. Geom. 18 (1997), 111–120.Google Scholar
[7] Oler, N., An inequality in the geometry of numbers. ActaMath. 105 (1961), 19–48.Google Scholar
[8] Verblunsky, S., On the least number of unit circles which can cover a square. J. London Math. Soc. 24 (1949), 164–170.Google Scholar