University of Cambridge > > Isaac Newton Institute Seminar Series > The least perimeter partition of a disc

The least perimeter partition of a disc

Add to your list(s) Download to your calendar using vCal

  • UserWang Chen (Aberystwyth University)
  • ClockWednesday 23 August 2023, 12:00-12:30
  • HouseExternal.

If you have a question about this talk, please contact nobody.

PMVW01 - 5th International Conference on Packing Problems: Packing and patterns in granular mechanics

We study the problem of partitioning a disc into N connected regions with two different areas while minimizing the perimeter. This becomes progressively more challenging as N increases due to the combinatorial increase in possible configurations. To address this issue, we propose an approach based on minima of a system of particles interacting via a potential function. These act as seed points for a Voronoi diagram, which gives appropriate topologies for the minimum perimeter, which are then evaluated using the Surface Evolver software. Our preliminary results indicate that this method accurately reproduces all existing conjectured candidates for N ≤ 10, while reducing computational resources. Moreover, we extend our findings by predicting potential candidate solutions for the least perimeter partition of a disc for N > 10.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity