As-Convex-As-Possible

Overview

We implemented approximate convex decomposition for triangle meshes using greedy hyperplane search and Monte Carlo tree search (MCTS) from the following papers:

• Approximate Convex Decomposition and Transfer for Animated Meshes, Thul et. al. 2018 Link to paper

• Approximate Convex Decomposition for 3D Meshes with Collision-Aware Concavity and Tree Search, Wei, Liu et al. Link to paper

• See our full presentation here: https://docs.google.com/presentation/d/1XWoBKuld85SKv0rsp7lt0hg1x7kxvBZF3tHRvmnoAsc/edit?usp=sharing