Mesh Simplification for Unfolding*
Loading...
Date
2024
Journal Title
Journal ISSN
Volume Title
Publisher
Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.
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.
Description
@article{10.1111:cgf.15269,
journal = {Computer Graphics Forum},
title = {{Mesh Simplification for Unfolding*}},
author = {Bhargava, M. and Schreck, C. and Freire, M. and Hugron, P. A. and Lefebvre, S. and Sellán, S. and Bickel, B.},
year = {2024},
publisher = {Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.15269}
}