Bhargava, M.Schreck, C.Freire, M.Hugron, P. A.Lefebvre, S.Sellán, S.Bickel, B.2025-03-072025-03-0720241467-8659https://doi.org/10.1111/cgf.15269https://diglib.eg.org/handle/10.1111/cgf15269We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: We modify the input shape until it admits an overlap‐free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper.Attribution-NonCommercial 4.0 Internationalfabricationsingle patch unfoldingmesh simplification• Computing methodologies → Shape modelling10.1111/cgf.1526913