Fast Equipartition of 2D Shapes

The goal of this problem is to obtain a segmentation into N equal area segments (regions).

This code is a simple implementation of SEP-FBC and SEP-PSO FBC algorithms proposed in [1]. The goal of this problem is to obtain a segmentation into N equal area segments (regions), where the number of segments (N) is given by the user, under the constraint that the boundaries between the segments have a minimum length.

You can find more details in [1]

Files:

runSEP_FBC.m: implemetation of the SEP-FBC method

runSEP_PSO_FBC.m: implemetation of the SEP-PSO FBC method

The user gives the number of segments and each method provides corresponding solutions of SEP.

[1] C. Panagiotakis, Fast Equipartition of Complex 2D Shapes with Minimal Boundaries, 2025.

You can download Datasets from:

https://sites.google.com/site/costaspanagiotakis/research/shape-equipartition