# Least-perimeter partition of the disc into N bubbles of two different areas

#### Standard

**Least-perimeter partition of the disc into N bubbles of two different areas.** / Headley, Francis; Cox, Simon.

Research output: Contribution to journal › Article › peer-review

#### Harvard

*European Physical Journal E*, vol. 42, 92. https://doi.org/10.1140/epje/i2019-11857-0

#### APA

*European Physical Journal E*,

*42*, [92]. https://doi.org/10.1140/epje/i2019-11857-0

#### Vancouver

#### Author

#### Bibtex - Download

}

### RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Least-perimeter partition of the disc into N bubbles of two different areas

AU - Headley, Francis

AU - Cox, Simon

N1 - Headley, F. & Cox, S. Eur. Phys. J. E (2019) 42: 92. https://doi.org/10.1140/epje/i2019-11857-0

PY - 2019/7/19

Y1 - 2019/7/19

N2 - We present conjectured candidates for the least perimeter partition of a disc into N≤10 connected regions which take one of two possible areas. We assume that the optimal partition is connected and enumerate all three-connected simple cubic graphs for each N. Candidate structures are obtained by assigning different areas to the regions: for even N there are N/2 bubbles of one area and N/2 bubbles of the other, and for odd N we consider both cases, i.e. in which the extra bubble takes either the larger or the smaller area. The perimeter of each candidate structure is found numerically for a few representative area ratios, and then the data is interpolated to give the conjectured least perimeter candidate for all possible area ratios. For each N we determine the ranges of area ratio for which each least perimeter candidate is optimal; at larger N these ranges are smaller, and there are more transitions from one optimal structure to another as the area ratio is varied. When the area ratio is significantly far from one, the least perimeter partitions tend to have a “mixed” configuration, in which bubbles of the same area are not adjacent to each other

AB - We present conjectured candidates for the least perimeter partition of a disc into N≤10 connected regions which take one of two possible areas. We assume that the optimal partition is connected and enumerate all three-connected simple cubic graphs for each N. Candidate structures are obtained by assigning different areas to the regions: for even N there are N/2 bubbles of one area and N/2 bubbles of the other, and for odd N we consider both cases, i.e. in which the extra bubble takes either the larger or the smaller area. The perimeter of each candidate structure is found numerically for a few representative area ratios, and then the data is interpolated to give the conjectured least perimeter candidate for all possible area ratios. For each N we determine the ranges of area ratio for which each least perimeter candidate is optimal; at larger N these ranges are smaller, and there are more transitions from one optimal structure to another as the area ratio is varied. When the area ratio is significantly far from one, the least perimeter partitions tend to have a “mixed” configuration, in which bubbles of the same area are not adjacent to each other

KW - soft matter

KW - self-organisation and supramolecular assemblies

U2 - 10.1140/epje/i2019-11857-0

DO - 10.1140/epje/i2019-11857-0

M3 - Article

C2 - 31313010

VL - 42

JO - European Physical Journal E

JF - European Physical Journal E

SN - 1292-8941

M1 - 92

ER -