Mesh Simplification for Unfolding<sup>*</sup>
Abstract We 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.
Authors
- Bernd Bickel (ORCID: https://orcid.org/0000-0001-6511-9385)
- Camille Schreck (ORCID: https://orcid.org/0000-0002-3787-249X)
- M. Freire (ORCID: https://orcid.org/0000-0002-0926-055X)
- Silvia Sellán (ORCID: https://orcid.org/0000-0003-0003-6807)
- Pierre-Alexandre Hugron (ORCID: https://orcid.org/0009-0001-5592-0723)
- Sylvain Lefèbvre (ORCID: https://orcid.org/0000-0002-9182-3146)
- Manas Bhargava (ORCID: https://orcid.org/0009-0007-6138-6890)
Institutions
- Centre National de la Recherche Scientifique (FR)
- Institute of Science and Technology Austria (AT)
- University of Toronto (CA)
- Canada Research Chairs (CA)
- ETH Zurich (CH)
- Massachusetts Institute of Technology (US)
- Université de Lorraine (FR)
Publication Details
- Journal
- Computer Graphics Forum
- Published
- 2024-11-15
- DOI
- https://doi.org/10.1111/cgf.15269
- Citations
- 2
- Primary Topic
- Computer Graphics and Visualization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.26
Funders
- Institut national de recherche en informatique et en automatique (INRIA)
- Natural Sciences and Engineering Research Council of Canada