Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible...
Transcript of Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible...
![Page 1: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/1.jpg)
Packings of Equal Circleson Flat Tori
William DickinsonWorkshop on RigidityFields InstituteOctober 14, 2011
![Page 2: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/2.jpg)
Introduction
Goal
Understand locally and globally maximally dense packings of equal circleson a fixed torus.
![Page 3: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/3.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
![Page 4: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/4.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
The action of SL(2,Z) (and scaling) on oriented lattices preserves thedensity of a packing and can be used to put the lattice into a normal form.As we are working with unoriented lattices this is further reduced to thefollowing forms:
![Page 5: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/5.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
The action of SL(2,Z) (and scaling) on oriented lattices preserves thedensity of a packing and can be used to put the lattice into a normal form.As we are working with unoriented lattices this is further reduced to thefollowing forms:
![Page 6: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/6.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
The action of SL(2,Z) (and scaling) on oriented lattices preserves thedensity of a packing and can be used to put the lattice into a normal form.As we are working with unoriented lattices this is further reduced to thefollowing forms:
For the optimal packings of 2 circles on anytorus with a length one closed geodesic seethe work of Przeworski (2006).
![Page 7: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/7.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
The action of SL(2,Z) (and scaling) on oriented lattices preserves thedensity of a packing and can be used to put the lattice into a normal form.As we are working with unoriented lattices this is further reduced to thefollowing forms:
A Square Torus is the quotient of the planeby unit perpendicular vectors. See the workof H. Mellisen (1997) – proofs for 3 and 4circles and conjectures up to 19 circles. Forlarge numbers (> 50) see the work ofLubachevsky, Graham, and Stillinger (1997).
![Page 8: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/8.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
The action of SL(2,Z) (and scaling) on oriented lattices preserves thedensity of a packing and can be used to put the lattice into a normal form.As we are working with unoriented lattices this is further reduced to thefollowing forms:
A Rectangular Torus is the quotient of theplane by perpendicular vectors. See the workof A. Heppes (1999) – proofs for 3 and 4circles.
![Page 9: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/9.jpg)
Introduction
Which Torus?
A flat torus is the quotient of the plane by a rank 2 lattice, R2/Λ
The action of SL(2,Z) (and scaling) on oriented lattices preserves thedensity of a packing and can be used to put the lattice into a normal form.As we are working with unoriented lattices this is further reduced to thefollowing forms:
A Triangular Torus is the quotient of theplane by unit vectors with a 60 degree anglebetween them. Understanding packings onthis torus might help prove a conjecture ofL. Fejes Toth on the solidity of thetriangular close packing in the plane withone circle removed.
![Page 10: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/10.jpg)
Packing Graphs & Strut Frameworks
Circle Packing
![Page 11: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/11.jpg)
Packing Graphs & Strut Frameworks
Circle Packing
⇔
Equilateral ToroidalPacking Graph
![Page 12: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/12.jpg)
Packing Graphs & Strut Frameworks
Circle Packing
⇔
Equilateral ToroidalPacking Graph
⇒
Combinatorial Graph
![Page 13: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/13.jpg)
Packing Graphs & Strut Frameworks
Circle Packing
⇔
Equilateral Toroidal
Strut FrameworkCombinatorial Graph
Viewing the packing graph as a strut framework helps us understand thepossible combinatorial (multi-)graphs.
![Page 14: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/14.jpg)
Rigid Spine And Free Circles
Consider the optimal packing of seven circles a hard boundary square. Dueto Schear/Graham(1965) Mellisen(1997)
![Page 15: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/15.jpg)
Rigid Spine And Free Circles
Consider the optimal packing of seven circles a hard boundary square. Dueto Schear/Graham(1965) Mellisen(1997)
The red circle is a free circle and the packing graph associated to thegreen circles form the rigid spine.
![Page 16: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/16.jpg)
Rigid Spine And Free Circles
Consider the optimal packing of seven circles a hard boundary square. Dueto Schear/Graham(1965) Mellisen(1997)
The red circle is a free circle and the packing graph associated to thegreen circles form the rigid spine. In what follows we will only considerpackings without free circles.
![Page 17: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/17.jpg)
Strut Frameworks: Rigidity and Infinitesimal Rigidity
An assignment of vectors (~p1, ~p2, ~p3, . . . , ~pn) to each of the vertices(p1, p2, p3, . . . , pn) in a toroidal strut framework is a infinitesimal flex ofthe arrangement if
(~pi − ~pj) · (pi − pj) ≥ 0
for each strut (i , j) in the framework.
![Page 18: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/18.jpg)
Strut Frameworks: Rigidity and Infinitesimal Rigidity
An assignment of vectors (~p1, ~p2, ~p3, . . . , ~pn) to each of the vertices(p1, p2, p3, . . . , pn) in a toroidal strut framework is a infinitesimal flex ofthe arrangement if
(~pi − ~pj) · (pi − pj) ≥ 0
for each strut (i , j) in the framework. If the strut framework only admitsconstant infinitesimal flexes then the framework is infinitesimally rigid .
![Page 19: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/19.jpg)
Strut Frameworks: Rigidity and Infinitesimal Rigidity
An assignment of vectors (~p1, ~p2, ~p3, . . . , ~pn) to each of the vertices(p1, p2, p3, . . . , pn) in a toroidal strut framework is a infinitesimal flex ofthe arrangement if
(~pi − ~pj) · (pi − pj) ≥ 0
for each strut (i , j) in the framework. If the strut framework only admitsconstant infinitesimal flexes then the framework is infinitesimally rigid .
Notes:
As this is a toroidal framework (pi − pj) will depend on more thanjust the vertices. The homotopy class of the struts matters.
![Page 20: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/20.jpg)
Strut Frameworks: Rigidity and Infinitesimal Rigidity
An assignment of vectors (~p1, ~p2, ~p3, . . . , ~pn) to each of the vertices(p1, p2, p3, . . . , pn) in a toroidal strut framework is a infinitesimal flex ofthe arrangement if
(~pi − ~pj) · (pi − pj) ≥ 0
for each strut (i , j) in the framework. If the strut framework only admitsconstant infinitesimal flexes then the framework is infinitesimally rigid .
Notes:
As this is a toroidal framework (pi − pj) will depend on more thanjust the vertices. The homotopy class of the struts matters.
This forms a system of homogeneous linear inequalities.
![Page 21: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/21.jpg)
Strut Frameworks: Rigidity and Infinitesimal Rigidity
An assignment of vectors (~p1, ~p2, ~p3, . . . , ~pn) to each of the vertices(p1, p2, p3, . . . , pn) in a toroidal strut framework is a infinitesimal flex ofthe arrangement if
(~pi − ~pj) · (pi − pj) ≥ 0
for each strut (i , j) in the framework. If the strut framework only admitsconstant infinitesimal flexes then the framework is infinitesimally rigid .
Notes:
As this is a toroidal framework (pi − pj) will depend on more thanjust the vertices. The homotopy class of the struts matters.
This forms a system of homogeneous linear inequalities.
Theorem (Connelly)
A (toroidal) strut framework is (locally) rigid if and only if infinitesimallyrigid
![Page 22: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/22.jpg)
Optimal Arrangements and Toroidal Strut Frameworks
Observation
Given a packing, if the associated toroidal strut framework is (locally) rigidthen the packing is locally maximally dense.
![Page 23: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/23.jpg)
Optimal Arrangements and Toroidal Strut Frameworks
Observation
Given a packing, if the associated toroidal strut framework is (locally) rigidthen the packing is locally maximally dense.
Theorem (Connelly)
If a toroidal packing is locally maximally dense then there is a subpackingwhose associated toroidal strut framework is (locally) rigid.
![Page 24: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/24.jpg)
Combinatorial Graph Edge Restrictions
Theorem (Connelly)
A locally maximally dense packing of n circles on a flat torus (without freecircles) has at least 2n − 1 edges.
Observations:
![Page 25: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/25.jpg)
Combinatorial Graph Edge Restrictions
Theorem (Connelly)
A locally maximally dense packing of n circles on a flat torus (without freecircles) has at least 2n − 1 edges.
Observations:
Each circle is tangent to at most 6 others
![Page 26: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/26.jpg)
Combinatorial Graph Edge Restrictions
Theorem (Connelly)
A locally maximally dense packing of n circles on a flat torus (without freecircles) has at least 2n − 1 edges.
Observations:
Each circle is tangent to at most 6 others
→ A combinatorial graph associated to an optimal packing has between2n− 1 and 3n edges.
![Page 27: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/27.jpg)
Combinatorial Graph Edge Restrictions
Theorem (Connelly)
A locally maximally dense packing of n circles on a flat torus (without freecircles) has at least 2n − 1 edges.
Observations:
Each circle is tangent to at most 6 others
→ A combinatorial graph associated to an optimal packing has between2n− 1 and 3n edges.
To be infinitesimally rigid each circle must be tangent to at least 3others and the points of tangency can’t be restricted to a closedsemi-circle.
![Page 28: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/28.jpg)
Combinatorial Graph Edge Restrictions
Theorem (Connelly)
A locally maximally dense packing of n circles on a flat torus (without freecircles) has at least 2n − 1 edges.
Observations:
Each circle is tangent to at most 6 others
→ A combinatorial graph associated to an optimal packing has between2n− 1 and 3n edges.
To be infinitesimally rigid each circle must be tangent to at least 3others and the points of tangency can’t be restricted to a closedsemi-circle.
→ Every vertex in a combinatorial graph associated to an optimal packingis incident to between 3 and 6 edges.
![Page 29: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/29.jpg)
Combinatorial Graph Edge Restrictions
Theorem (Connelly)
A locally maximally dense packing of n circles on a flat torus (without freecircles) has at least 2n − 1 edges.
Observations:
Each circle is tangent to at most 6 others
→ A combinatorial graph associated to an optimal packing has between2n− 1 and 3n edges.
To be infinitesimally rigid each circle must be tangent to at least 3others and the points of tangency can’t be restricted to a closedsemi-circle.
→ Every vertex in a combinatorial graph associated to an optimal packingis incident to between 3 and 6 edges.
Note: These observations are enough to determine all the optimalpackings of 1-4 circles on a square flat torus.
![Page 30: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/30.jpg)
Algorithm
To determine all possible optimal packings of n circles on a torus:
![Page 31: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/31.jpg)
Algorithm
To determine all possible optimal packings of n circles on a torus:
1 Determine all the possible combinatorial graphs that could beassociated to a locally maximally dense packing of n circles. (Useedge restrictions from Ridigity Theory.)
![Page 32: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/32.jpg)
Algorithm
To determine all possible optimal packings of n circles on a torus:
1 Determine all the possible combinatorial graphs that could beassociated to a locally maximally dense packing of n circles. (Useedge restrictions from Ridigity Theory.)
2 For each combinatorial graph determine all the possible ways it can beembedded on a topological torus. (Use Topological Graph Theory.)
![Page 33: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/33.jpg)
Algorithm
To determine all possible optimal packings of n circles on a torus:
1 Determine all the possible combinatorial graphs that could beassociated to a locally maximally dense packing of n circles. (Useedge restrictions from Ridigity Theory.)
2 For each combinatorial graph determine all the possible ways it can beembedded on a topological torus. (Use Topological Graph Theory.)
3 For each embedding, determine if there exists an equilateralembedding on fixed torus (with all angles bigger or equal to 60degrees).
![Page 34: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/34.jpg)
Algorithm
To determine all possible optimal packings of n circles on a torus:
1 Determine all the possible combinatorial graphs that could beassociated to a locally maximally dense packing of n circles. (Useedge restrictions from Ridigity Theory.)
2 For each combinatorial graph determine all the possible ways it can beembedded on a topological torus. (Use Topological Graph Theory.)
3 For each embedding, determine if there exists an equilateralembedding on fixed torus (with all angles bigger or equal to 60degrees).
Alternatively, construct the equilateral embedding and let it determinethe torus or tori onto which it embeds.
![Page 35: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/35.jpg)
Algorithm
To determine all possible optimal packings of n circles on a torus:
1 Determine all the possible combinatorial graphs that could beassociated to a locally maximally dense packing of n circles. (Useedge restrictions from Ridigity Theory.)
2 For each combinatorial graph determine all the possible ways it can beembedded on a topological torus. (Use Topological Graph Theory.)
3 For each embedding, determine if there exists an equilateralembedding on fixed torus (with all angles bigger or equal to 60degrees).
Alternatively, construct the equilateral embedding and let it determinethe torus or tori onto which it embeds.
4 Determine which equilateral embeddings are associated to locallymaximally dense packings.
![Page 36: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/36.jpg)
Three Circle Case
Step 1: Partial list of possible combinatorial graphs.
![Page 37: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/37.jpg)
Three Circle CaseStep 2: Partial list of all embeddings of the combinatorial graphs on atopological torus.
Many embeddingswith all circles
self tangent
![Page 38: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/38.jpg)
Three Circle CaseSteps 3 & 4: Equilateral Embeddings and Locally Maximally DensePacking/Regions.
![Page 39: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/39.jpg)
Minimally Dense Arrangements
Rectangular Torus, ≈ 1.35 ratio
Density = 2π√3√
138+22√33
≈ 0.66930
![Page 40: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/40.jpg)
Minimally Dense Arrangements
Equilateral Torus, 100 DegreesDensity = 3π
16 sin( 4π9)≈ 0.61673
Rectangular Torus, ≈ 1.35 ratio
Density = 2π√3√
138+22√33
≈ 0.66930
![Page 41: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/41.jpg)
Tool: Stressed Arrangements
Definition
A collection of scalars ωij = ωji (one for each strut) is called an self-stressif∑
j ωij(pj − pi) = ~0 for all vertices pi .
![Page 42: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/42.jpg)
Tool: Stressed Arrangements
Definition
A collection of scalars ωij = ωji (one for each strut) is called an self-stressif∑
j ωij(pj − pi) = ~0 for all vertices pi .
Theorem (Roth-Whiteley)
A toroidal strut framework is (infinitesimally) rigid if and only if it isinfinitesimally rigid as a bar framework and it has a self-stress that has thesame sign and is non-zero on every strut.
![Page 43: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/43.jpg)
Tool: Stressed Arrangements
Definition
A collection of scalars ωij = ωji (one for each strut) is called an self-stressif∑
j ωij(pj − pi) = ~0 for all vertices pi .
Theorem (Roth-Whiteley)
A toroidal strut framework is (infinitesimally) rigid if and only if it isinfinitesimally rigid as a bar framework and it has a self-stress that has thesame sign and is non-zero on every strut.
Theorem (Connelly)
On a fixed torus, suppose there is a packing so that the associatedequilateral strut framework, F , is infinitesimally rigid then any otherinfinitesimally rigid, equilateral strut framework freely homotopic to F onthe torus is congruent to F by translation.
![Page 44: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/44.jpg)
Two Locally Optimally Dense Arrangements on One Torus
![Page 45: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/45.jpg)
Two Locally Optimally Dense Arrangements on One Torus
The packing graphs are not homotopic on the fixed torus.
![Page 46: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/46.jpg)
Other Results on the Square and Triangular Torus
Using the same techniques the following are optimally dense.
5 CirclesSquare Torus10 contacts
![Page 47: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/47.jpg)
Other Results on the Square and Triangular Torus
Using the same techniques the following are optimally dense.
5 CirclesSquare Torus10 contacts
5 CirclesTriangular Torus
9 contacts
![Page 48: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/48.jpg)
Other Results on the Square and Triangular Torus
Using the same techniques the following are optimally dense.
5 CirclesSquare Torus10 contacts
5 CirclesTriangular Torus
9 contacts
6 CirclesTriangular Torus
18 contacts
![Page 49: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/49.jpg)
Strictly Jammed / Periodically Stable Packings
Definition
A packing on a torus is strictly jammed if there is no non-trivialinfinitesimal motion of the packing, as well as the lattice defining thetorus, subject to the condition that the total area of the torus does notinfinitesimally increase.
![Page 50: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/50.jpg)
Strictly Jammed / Periodically Stable Packings
Definition
A packing on a torus is strictly jammed if there is no non-trivialinfinitesimal motion of the packing, as well as the lattice defining thetorus, subject to the condition that the total area of the torus does notinfinitesimally increase.
Counting for a toroidal packing of n circles:
![Page 51: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/51.jpg)
Strictly Jammed / Periodically Stable Packings
Definition
A packing on a torus is strictly jammed if there is no non-trivialinfinitesimal motion of the packing, as well as the lattice defining thetorus, subject to the condition that the total area of the torus does notinfinitesimally increase.
Counting for a toroidal packing of n circles:Constraints: Packing Edges: e Area Constraint: 1
![Page 52: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/52.jpg)
Strictly Jammed / Periodically Stable Packings
Definition
A packing on a torus is strictly jammed if there is no non-trivialinfinitesimal motion of the packing, as well as the lattice defining thetorus, subject to the condition that the total area of the torus does notinfinitesimally increase.
Counting for a toroidal packing of n circles:Constraints: Packing Edges: e Area Constraint: 1
Variables: Coordinates: 2n Lattice Vectors: 4
![Page 53: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/53.jpg)
Strictly Jammed / Periodically Stable Packings
Definition
A packing on a torus is strictly jammed if there is no non-trivialinfinitesimal motion of the packing, as well as the lattice defining thetorus, subject to the condition that the total area of the torus does notinfinitesimally increase.
Counting for a toroidal packing of n circles:Constraints: Packing Edges: e Area Constraint: 1
Variables: Coordinates: 2n Lattice Vectors: 4Trivial Motions: Translations: 2 Rotation: 1
![Page 54: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/54.jpg)
Strictly Jammed / Periodically Stable Packings
Definition
A packing on a torus is strictly jammed if there is no non-trivialinfinitesimal motion of the packing, as well as the lattice defining thetorus, subject to the condition that the total area of the torus does notinfinitesimally increase.
Counting for a toroidal packing of n circles:Constraints: Packing Edges: e Area Constraint: 1
Variables: Coordinates: 2n Lattice Vectors: 4Trivial Motions: Translations: 2 Rotation: 1
To have a unique solution, you must have one more inequality/constraintthan unconstrained variables so (e + 1) ≥ (2n + 4)− (2 + 1) + 1 or
e ≥ 2n + 1
in order to possibly be strictly jammed.
![Page 55: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/55.jpg)
Non-Triangular-Close Based Strictly Jammed Example
(Connelly)
10 Circles≈ 75◦ Torus with ≈ 1.17 Ratio
22 contacts
![Page 56: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/56.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
![Page 57: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/57.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
How can we algorithmically or computationally determine if anembedded toroidal graph
![Page 58: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/58.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
How can we algorithmically or computationally determine if anembedded toroidal graph
has an equilateral embedding
![Page 59: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/59.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
How can we algorithmically or computationally determine if anembedded toroidal graph
has an equilateral embeddingcorresponds to a locally optimal packing
![Page 60: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/60.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
How can we algorithmically or computationally determine if anembedded toroidal graph
has an equilateral embeddingcorresponds to a locally optimal packing
Find other examples of strictly jammed packings and work towardunderstanding the connection between a packing being strictlyjammed and packings such that every cover of the torus is locallyoptimal.
![Page 61: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/61.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
How can we algorithmically or computationally determine if anembedded toroidal graph
has an equilateral embeddingcorresponds to a locally optimal packing
Find other examples of strictly jammed packings and work towardunderstanding the connection between a packing being strictlyjammed and packings such that every cover of the torus is locallyoptimal.
Is this algorithm practical for toroidal bi- or poly-dispersed packings?
![Page 62: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/62.jpg)
Questions/Future Work
Continue to explore packing of small numbers of circles on the torusor other smooth flat domains.
How can we algorithmically or computationally determine if anembedded toroidal graph
has an equilateral embeddingcorresponds to a locally optimal packing
Find other examples of strictly jammed packings and work towardunderstanding the connection between a packing being strictlyjammed and packings such that every cover of the torus is locallyoptimal.
Is this algorithm practical for toroidal bi- or poly-dispersed packings?
Is there a 3-d analog for this algorithm for packing sphere in a3-torus?
![Page 63: Equal Circle Packing - Fields Institute › ... › Dickinson.pdf · 1 Determine all the possible combinatorial graphs that could be associated to a locally maximally dense packing](https://reader033.fdocuments.in/reader033/viewer/2022060418/5f1577838e2cd037d40abaf0/html5/thumbnails/63.jpg)
Thank You
This work was partially supported by National Science Foundation grantDMS-1003993, which funds a Research Experience for Undergraduatesprogram at Grand Valley State University.