Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T18:45:41.131Z Has data issue: false hasContentIssue false

Packing and covering with convex discs

Published online by Cambridge University Press:  26 February 2010

L. Fejes Tóth
Affiliation:
Mathematical Institute, Hungarian Academy of Sciences, Reáltanoda ut. 13–15, H-1053 Budapest, Hungary
A. Florian
Affiliation:
Institut für Mathematik, Universität Salzburg, PetersbrunnstraBe 19, A-5020 Salzburg, Austria
Get access

Extract

Before turning to the questions to be considered in this paper, we recall two other problems. Let C(a, p) be the class of all convex discs of area not less than a given constant a and perimeter not greater than a given constant p. What is the densest packing and what is the most economical covering of the Euclidean plane with discs from C(a, p)?

Both problems are interesting only if p2/a < 8√3, i.e. if p is less than the perimeter of a regular hexagon of area a. In this case, the densest packing arises from a regular hexagonal tiling by rounding off the corners of the tiles by equal circular arcs so as to obtain smooth hexagons of area a and perimeter p.

Information

Type
Research Article
Copyright
Copyright © University College London 1982

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable