Kintsugi, Upcycling and Machine Learning

This project is an exploration of different stacking methods of fragments using computation, and comparing the Hungarian algorithm with Minkowski difference Algorithm in nesting items. A python code on Grasshopper was scripted to provide a method of iteratively stacking fragments one-by-one. Using the Minkowski Difference Algorithm (a simple subtraction of vertices), a path to move polygons around without collision is generated, allowing us to stack fragments together without overlap. This method is already used in graphic modeling for detecting collisions and nesting applications such as SVGNest by Jack Qiao. Many parameters such as rotation, trying different orientations, were explored to find a more efficient method of stacking the fragments.