Bastien Harismendy ; Tom da Silva ; Gaëlle Largeteau-Skapin ; Éric Andrès - Unfolding Solid Polycubes

dmtcs:16116 - Discrete Mathematics & Theoretical Computer Science, June 27, 2026, vol. 28:2 - https://doi.org/10.46298/dmtcs.16116
Unfolding Solid PolycubesArticle

Authors: Bastien Harismendy 1; Tom da Silva 1; Gaëlle Largeteau-Skapin ORCID1,2; Éric Andrès ORCID3,1


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.


Volume: vol. 28:2
Section: Discrete Algorithms
Published on: June 27, 2026
Accepted on: February 4, 2026
Submitted on: July 25, 2025
Keywords: [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] edge unfolding, solid polycube, Discrete geometry

Consultation statistics

This page has been seen 66 times.
This article's PDF has been downloaded 38 times.