LIPIcs.SoCG.2022.67.pdf
- Filesize: 0.84 MB
- 4 pages
Document
Visualizing and Unfolding Nets of 4-Polytopes (Media Exposition)
Authors
Sam Zhang 
-
Part of:
Volume:
38th International Symposium on Computational Geometry (SoCG 2022)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-06-01
File
Document Identifiers
Author Details
Cite AsGet BibTex
Satyan L. Devadoss, Matthew S. Harvey, and Sam Zhang. Visualizing and Unfolding Nets of 4-Polytopes (Media Exposition). In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 67:1-67:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SoCG.2022.67
https://doi.org/10.4230/LIPIcs.SoCG.2022.67
Abstract
Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. Recent work has extended this property to their higher-dimensional analogs: the 4-cube, 4-simplex, and 4-orthoplex. We present an interactive visualization that allows the user to unfold these polytopes by drawing on their dual 1-skeleton graph.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational geometry
- Applied computing → Computer-assisted instruction
Keywords
- unfoldings
- nets
- polytopes
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Francis Buekenhout and Monique Parker. The number of nets of the regular convex polytopes in dimension ≤ 4. Discrete mathematics, 186:69-94, 1998.
-
Kristin DeSplinter, Satyan L Devadoss, Jordan Readyhough, and Bryce Wimberly. Unfolding cubes: Nets, packings, partitions, chords. Electronic Journal of Combinatorics, 27:4-41, 2020.
- Satyan L Devadoss and Matthew Harvey. Unfoldings and nets of regular polytopes. arXiv, 2021. URL: http://arxiv.org/abs/2111.01359.
-
Paul Dodd, Pablo Damasceno, and Sharon Glotzer. Universal folding pathways of polyhedron nets. Proceedings of the National Academy of Science, 115:6690-6696, 2018.
- Mr. Doob. ThreeJS, 2021. URL: https://github.com/mrdoob/threejs.
-
Michael Gerhäuser, Bianca Valentin, and Alfred Wassermann. JSXGraph: Dynamic mathematics with JavaScript. International Journal for Technology in Mathematics Education, 17(4), 2010.
-
Takashi Horiyama and Wataru Shoji. Edge unfoldings of platonic solids never overlap. In Proceedings of the 23rd Canadian Conference on Computational Geometry, 2011.
-
Geoffrey C Shephard. Convex polytopes with convex nets. In Mathematical Proceedings of the Cambridge Philosophical Society, volume 78. Cambridge University Press, 1975.