Professional Documents
Culture Documents
Parcels of Pi
a curve-packing problem
1
Rachel Beckett: A curve-packing problem
2
Rachel Beckett: A curve-packing problem
Parcels of Pi
a curve-packing problem
CONTENTS
An artists algorithm 5
A square to get started 6
Tackling the rectangles 7
Meet the family! 10
Rival rectangles 15
Cousins once removed 16
Sorting the sections 19
Extended families 21
Heading for the hills 23
Concluding remarks 27
A note on sources 30
3
Rachel Beckett: A curve-packing problem
Important Note
Throughout this paper all quadrilaterals illustrated
are rectangles. Therefore, to avoid cluttering the
diagrams, right angles are not marked.
4
Rachel Beckett: A curve-packing problem
5
Rachel Beckett: A curve-packing problem
I
R K F
A square to
get started A G L H B
Being a rectangle, ABCD has opposite sides parallel. I drew in two lines of symmetry, (two diameters
perpendicular to each other), such that the circle is divided into four congruent quarter-circle sectors and
ABCD into four congruent rectangles. Now anything I prove for quarter-circle sector OIJ is reflected in the
other quadrants and anything I prove for rectangle OLBE is true for the other quarters of ABCD.
I
Proof that OLBE is a square K F
OLBE is the largest rectangle (ie. of maximum area)
that can be inscribed within sector OIJ.
Let its area be a(a + d), where d < a.
DOBE is a right-angled triangle and OB = 1. L H B
Let BOE = 1, so that a = Cos1 and a + d = Sin1.
I want the maximum value for Sin1Cos1.
My unit circle has a radius of 1, so if OLBE is a
square, 1 = /4 and Sin1 = Cos1 = 1/2. r=1
In that case, Sin1Cos1 = (1/2)2 = . a+d
Assuming then that OLBE is not a square:
a2 + (a + d)2 = 1
2a2 + 2ad + d2 = 1
q1
2a2 + 2ad = 1 - d2
a (a + d) = - d2 a
J
O E
6
Rachel Beckett: A curve-packing problem
I N
Unless d = 0, d must be positive which
2
R would mean M F
a (a + d) < . K P
Therefore the largest possible area for OLBE is ,
which occurs when d = 0.
G
OLBE is a square with area a2 = Sin1Cos1 = .
L H B
Ill call this area A1. The angle 1 = /4 or 45.
My first conjecture was that arc IF = arc FB and that Hence for A2 = Sin22 2Cos2,
2 = 3/8 = 1.178097c (3dp). dA2 = Cos22 + 2Sin2.
When 2 = 1.178097c , A2 = 0.08296 (5dp). d2
Taking values near to 1.178097c, on either side:
f(1.181c) = 0.08279 (5dp); At the maximum value of A2, dA2 = 0, hence
but f(1.175c) = 0.08312 (5dp). d2
Since 0.08312 > 0.08296, my conjecture was wrong. Cos22 + 2Sin2 = 0.
From the double-angle formula
I need to differentiate A2 in order to calculate its Cos2 Cos2 Sin2, my equation becomes:
maximum value, but first I must rearrange it. Cos22 Sin22 + 2Sin2 = 0.
7
Rachel Beckett: A curve-packing problem
Z
'SWCVKQP[UKPZEQUZ
'SWCVKQPZ
'SWCVKQPZ
'SWCVKQP[
'SWCVKQP[
8
Rachel Beckett: A curve-packing problem
Z
9
Rachel Beckett: A curve-packing problem
I I Q
M N X
F
K P Z Y
L H B B
3 n
P/4
J J
O E O
The defining angle for rectangle KMNP (left) and (right) the defining angle for a general rectangle ZXQP (based on KMNP).
10
Rachel Beckett: A curve-packing problem
12
Rachel Beckett: A curve-packing problem
I A5A4
R K F A3
A2
A G L H B
A1
A2
A3
A4
J A5
O E
C D
I know that 4 A1 squares make square ABCD, the shown as the pink squares and pale blue rectangles
largest rectangle in the unit circle, and that in the image below.
2 A2 rectangles constitute the second largest,
inscribed in segment AIB (see diagram above Rectangle 2 A3, the next in the series defined by
left). AIB is one of the four remaining congruent my formula, is the largest that will fit in segment RIF
segments, containing congruent rectangles. So (see diagrams above) but I shall not know whether
I know the areas of the five largest rectangles. it is the next largest rectangle to fit in the unit circle
Combined, their areas equal 2.6735 (5sf). They are until I have first investigated section FHB.
A3 A3
A2 A2
A1 A1
A2 A2
A3 A3
A3 A3
A2 A2
A1 A1
A2 A2
A3 A3
13
Rachel Beckett: A curve-packing problem
Series A Series D
Series B Series E
Series C Series F
14
Rachel Beckett: A curve-packing problem
A5A4
Rival rectangles A3 2 = 1.13289996c
At this point I want to state a conjecture to which A2 = B1
I shall return later, namely that there is an infinite B2
number of families of rectangles within my unit
B3 1 = /4
circle, as illustrated in the diagrams on these two
B3
pages. Any pair of adjacent rectangles already
inscribed defines a new section of the circle, one of a AB2
unique group of eight congruent ones symmetrically 2
arranged around the square, two in each quarter- A1
circle. Each of these sections contains two subseries A2 = B1
of rectangles, one in a horizontal axis and one
in a vertical axis. Each rectangle is one of eight A3
congruent ones (in the eight congruent sections). A4
The six diagrams showing series A, B, C, D, E and
A5
F illustrate this conjecture. Note that the orientation So the best way of choosing the next rectangle to
of the rows of rectangles alternates between vertical test, is to first find the largest remaining section
and horizontal. Every rectangle (except the large of the circle, then write a function for its largest
square) belongs to more than one series (see diagram rectangle, maximise this and solve it.
below).
This could be quite a challenge, as I would need
There will not be scope in this paper to prove my a reliable way of determining the rankings of the
conjecture in its entirety, but I shall explore it further sections before I even began testing the rectangles.
and find more evidence as my discussion continues. Also, although it seems very likely that the areas of
the sections will rank in the same order as the areas
To return to my main purpose, I want to be able to of their inscribed rectangles, I would need to prove
rank the rectangles that fit the unit circle in order of that this is the case.
size. It seems likely that the next largest rectangle
will always be in the largest remaining section of the I decided that, before attempting a more general
circle (one of eight congruent ones). solution I would identify what appears to be the
largest remaining section, write a function for its
B2 = C1 largest rectangle, and then compare the maximum
A 3 = D1
A2 = B1 A2 = B1 size of this rectangle with that of any rival rectangle.
By solving one rectangle at a time, I can rank each
one in relation to those I have solved already.
B3 = E1 A2 = B1 A2 = B1 A2 C2 = F1
15