This repository contains all code written for my Bachelor's Thesis at IIIT-Delhi. Currently we are trying to enumerate optimal cut sequences for Axis Parallel Rectangles. The general problem dates back to the paper Cutting Glass [Pach et al] but the specific problem we're working on is presented directly in On Guillotine Cutting Sequences [Abed et al]. In particular, we want to know if one can always save Omega(n) rectangles and exactly what fraction is feasible.
- Generating Tree : In this phase we enumerate a set of permutations using a Generating Tree, explained in linked paper.
- Permutation 2 Floorplan : We interpret the permutation as a mosaic floorplan.
- Compute Optimal-Cut-Seq: Finally, we compute the optimal Guillotine cut sequence on the set of rectangles.