Master's Thesis: Split Packing

Circle packing algorithms
2016-06-01 (last update: 2017-01-20) / Sebastian Morr / CC BY-NC-SA 4.0 / document, paper, talk, cs, art, fav

The full name of my master’s thesis is Split Packing: An Algorithm for Packing Circles with up to Critical Density. It covers a topic from the field of Computational Geometry: Packing circles into various containers, like squares and triangles.

In the thesis, I invented an algorithm which can pack circles and other objects into these containers, if their combined area does not exceed certain bounds. The special property of the algorithm is that these bounds are tight: For any larger area bound, there are circle instances which can not be packed.

The thesis contains a large number of figures, I’d like to invite you to take a look! :-)

Thesis Presentation

For the presentation I created a nonverbal description of the central algorithm in the style of IKEA assembly instructions. I’d love to see more algorithms presented like this, if you’d like to try for yourself, you can use my SVG as a starting point!

SPLIT-PÄCK

Also, while working on this thesis, I wrote an interactive visualization tool called Circus, which I used as a personal thinking and explaining tool. You can try it out by clicking on the image below, usage instructions are located in the lower left. The tool is written in plain CoffeeScript and uses the HTML5 canvas for drawing, the source code is on GitHub.

Screenshot of the Circus visualization tool


Comments?

You can reach me at @blinry or at sebastian@morr.cc, see the about page.

For more like this, check out the home page, follow me on Twitter or subscribe to this site's feed.