Unfolding Solid Polycubes
Discrete Mathematics & Theoretical Computer Science · 27.06.2026 · vol. 28:2 (Discrete Algorithms)
DOI: 10.46298/dmtcs.16116 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 27.06.2026. Verfasst von Bastien Harismendy und 3 weiteren Autor:innen.
Abstract (Originalsprache)
A solid polycube is a face-connected set of unit cubes, where, unlike classical definitions for polycubes, shared faces between adjacent cubes are not removed. We prove by mathematical induction that any such polycube can be edge-unfolded into a 2D net without refinement. Our proof relies on the concept of a perfect net, defined as a net in which two designated edges are placed on the far left and far right sides. This configuration enables consistent gluing of nets in a single direction throughout the induction process, thereby guaranteeing that no overlaps occur at any step.
Zitieren
APA
Harismendy, B., Silva, T. D., Largeteau-Skapin, G., & Andrès, É. (2026). Unfolding Solid Polycubes. Discrete Mathematics & Theoretical Computer Science, vol. 28:2(Discrete Algorithms). https://doi.org/10.46298/dmtcs.16116
Vancouver
Harismendy B, Silva TD, Largeteau-Skapin G, Andrès É. Unfolding Solid Polycubes. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:2(Discrete Algorithms). doi:10.46298/dmtcs.16116
BibTeX
@article{Harismendy2026,
author = {Harismendy, Bastien and Silva, Tom da and Largeteau-Skapin, Gaëlle and Andrès, Éric},
title = {Unfolding Solid Polycubes},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 28:2},
number = {Discrete Algorithms},
doi = {10.46298/dmtcs.16116}
}
EUVIMED