Unfolding via Progressive Mesh Approximation
Lars Zawallich, Renato Pajarola
TL;DR
The paper proposes a progressive mesh unfolding framework that couples edge-collapse-based simplification with Tabu Unfolding to search for overlap-free unfoldings. By allowing the approximating mesh to change during unfolding and then reversing the simplification, the method can overcome not-unfoldability and deliver faster, more reliable results than prior approaches. Empirical evaluations on a Thingi10k subset show competitive coverage and stable aspect ratios, with improved reliability and significant timing advantages, particularly using Quadric Error-based collapses. The approach eliminates the need for mesh segmentation and broadens practical applicability to manufacturing pipelines for paper-based folding, architecture, and robotics.
Abstract
When folding a 3D object from a 2D material like paper, typically only an approximation of the original surface geometry is needed. Such an approximation can effectively be created by a (progressive) mesh simplification approach, e.g. using an edge collapse technique. Moreover, when searching for an unfolding of the object, this approximation is assumed to be fixed. In this work, we take a different route and allow the approximation to change while searching for an unfolding. This way, we increase the chances to overcome possible ununfoldability issues. To join the two concepts of mesh approximation and unfolding, our work combines the edge collapsing mesh simplification technique with a Tabu Unfolder, a robust mesh unfolding approach. We empirically show that this strategy performs faster and that it is more reliable than prior state of the art methods.
