Mesh Simplification for Unfolding *
Computer Graphics Forum · 2025-02 · 44 (1)
DOI: 10.1111/cgf.15269 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Graphics Forum, online erschienen am 15.11.2024. Verfasst von M. Bhargava und 6 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., & Bickel, B. (2025). Mesh Simplification for Unfolding *. Computer Graphics Forum, 44(1). https://doi.org/10.1111/cgf.15269
Vancouver
Bhargava M, Schreck C, Freire M, Hugron PA, Lefebvre S, Sellán S, et al. Mesh Simplification for Unfolding *. Computer Graphics Forum. 2025;44(1). doi:10.1111/cgf.15269
BibTeX
@article{Bhargava2025,
author = {Bhargava, M. and Schreck, C. and Freire, M. and Hugron, P. A. and Lefebvre, S. and Sellán, S. and Bickel, B.},
title = {Mesh Simplification for Unfolding *},
journal = {Computer Graphics Forum},
year = {2025},
volume = {44},
number = {1},
doi = {10.1111/cgf.15269}
}
EUVIMED