Optimization

Extended Eisenberger et al.’s divergence-free shape interpolation by introducing time-dependent vector fields, lifting the limitation that different parts of a shape cannot move in conflicting directions through the same point in space. Correspondence and matching are jointly solved over the full sequence during optimization.

Built a C++ library and an efficient CNF encoding for solving Pseudo-Boolean Optimization problems via off-the-shelf SAT solvers, with linear and binary minimization strategies and configurable timeout policies for time-bounded solving.