Abstract
In this article, we suggest a grid-unfolding of level 1 Menger polycubes of arbitrary size with L holes along the x-axis, M the y-axis and N the z-axis. These polycubes can have a high genus, and most vertices are of degree 6. The unfolding is based mainly on the inner faces (that do not lie on the outer most envelope) except for some outer faces that are needed to connect lines or planes in the object. It is worth noticing that this grid-unfolding algorithm is deterministic and without refinement.
Author supplied keywords
Cite
CITATION STYLE
Richaume, L., Andres, E., Largeteau-Skapin, G., & Zrour, R. (2019). Unfolding level 1 menger polycubes of arbitrary size with help of outer faces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11414 LNCS, pp. 457–468). Springer Verlag. https://doi.org/10.1007/978-3-030-14085-4_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
