2D Shape Equipartition

A segmentation of a region into N equal area segments so that the boundaries between the segments have a minimum length.

This code is a simple implementation of 2D-SEP and 2D-SEP-LS 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_RG.m: implemetation of the 2D-SEP-RG method

runSEP_ILS.m: implemetation of the 2D-SEP-ILS method

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

[1] C. Panagiotakis, The 2D Shape Equipartition Problem under Minimum Boundary Length, ICPR, 2024.

You can download Datasets from:

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