Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T10:04:59.041Z Has data issue: false hasContentIssue false
  • English
  • Français

On closest packing by equilateral triangles

Published online by Cambridge University Press:  24 October 2008

H. G. Eggleston
H. G. Eggleston
Affiliation:
University CollegeSwansea
Get access Rights & Permissions [Opens in a new window]

Extract

The problem with which this paper is concerned is that of packing non-overlapping plane figures into a given plane figure. It is of a different type from the usual packing problem in which equal figures are used in the whole plane, and the aim is to calculate the limit of the ratio of covered area to the total area inside a large circle, as the radius of the circle tends to infinity. A closest packing in this problem is an arrangement of the figures in such a way that this limit attains its largest value.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 49 , Issue 1 , January 1953 , pp. 26 - 30
Copyright
Copyright © Cambridge Philosophical Society 1953

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.)

References

* The words square, circle, etc., are used to mean either the bounding curve or the bounded domain according to the context.

* X τY τ and E jF j are both to be parallel to AB.