Unfolding Polycubes with Orthogonally Convex Layers
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913938544787456 |
|---|---|
| author | Damian, Mirela Meijer, Henk |
| author_facet | Damian, Mirela Meijer, Henk |
| contents | A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We present an unfolding algorithm that flattens any polycube with orthogonally convex layers into a single, non-overlapping planar piece. The algorithm makes cuts only along cube edges-that is, it is an edge unfolding. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_01326 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unfolding Polycubes with Orthogonally Convex Layers Damian, Mirela Meijer, Henk Computational Geometry F.2.2 A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We present an unfolding algorithm that flattens any polycube with orthogonally convex layers into a single, non-overlapping planar piece. The algorithm makes cuts only along cube edges-that is, it is an edge unfolding. |
| title | Unfolding Polycubes with Orthogonally Convex Layers |
| topic | Computational Geometry F.2.2 |
| url | https://arxiv.org/abs/2407.01326 |