Skip to content
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.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
BP2FP
Experimentation
Plotter
Prototypes
bxt
div
eqv
img
mocs
pkg
sep
FullResults.txt
LICENSE
README.md
RESULTS.md
main.go

README.md

Guillotine Cuts

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.

Guide

3 Phases

  • 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.
You can’t perform that action at this time.