Optimization

In this project, we extended the work of Eisenberger, Zorah, Cremers, “Divergence-Free Shape Interpolation and Correspondence” 1. In their work, they present a method to calculate deformation fields between shapes embedded in $\mathbb{R}^D$.

Bachelor’s thesis Boolean Satisfiability problems (SAT) consists of finding a valid assignment (model) for a set of Boolean variables. It was the first problem proven to be NP-Complete which allowed reducing many NP-Complete problems to it.