Mesh simplification for unfolding

Download
OA Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4 37.00 MB [Published Version] OA 2025_CompGraphicsForum_Bhargava.pdf 5.19 MB

Journal Article | Published | English

Scopus indexed
Author
Bhargava, ManasISTA ; Schreck, CamilleISTA; Freire, M.; Hugron, P. A.; Lefebvre, S.; Sellán, S.; Bickel, BerndISTA

Corresponding author has ISTA affiliation

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.
Publishing Year
Date Published
2025-02-01
Journal Title
Computer Graphics Forum
Publisher
Wiley
Acknowledgement
Researchers from INRIA received support from the DORNELL Inria Challenge. Silvia Sellán acknowledges support from NSERC Vanier Doctoral Scholarship and an MIT SoE Postdoctoral Fellowship for Engineering Excellence.
Volume
44
Issue
1
Article Number
e15269
ISSN
eISSN
IST-REx-ID
All files available under the following license(s):
Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0):
Main File(s)
Access Level
OA Open Access
Date Uploaded
2024-11-19
MD5 Checksum
34acdd9bfbe43f00eb6c7656afef3ac6
Access Level
OA Open Access
Date Uploaded
2025-04-16
MD5 Checksum
efb06b01bae37f470954601bc004374d


Export

Marked Publications

Open Data ISTA Research Explorer

Sources

arXiv 2408.06944

Search this title in

Google Scholar