Mesh Simplification For Unfolding
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914911488049152 |
|---|---|
| author | Bhargava, Manas Schreck, Camille Freire, Marco Hugron, Pierre-Alexandre Lefebvre, Sylvain Sellán, Silvia Bickel, Bernd |
| author_facet | Bhargava, Manas Schreck, Camille Freire, Marco Hugron, Pierre-Alexandre Lefebvre, Sylvain Sellán, Silvia Bickel, Bernd |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_06944 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Mesh Simplification For Unfolding Bhargava, Manas Schreck, Camille Freire, Marco Hugron, Pierre-Alexandre Lefebvre, Sylvain Sellán, Silvia Bickel, Bernd Graphics 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. |
| title | Mesh Simplification For Unfolding |
| topic | Graphics |
| url | https://arxiv.org/abs/2408.06944 |