Unfoldings and Nets of Regular Polytopes

11/02/2021
by   Satyan L. Devadoss, et al.
0

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and orthoplex. It was recently proven that all unfoldings of the n-cube yield nets. We show this is also true for the n-simplex and the 4-orthoplex but demonstrate its surprising failure for any orthoplex of higher dimension.

READ FULL TEXT

page 1

page 2

page 3

page 5

page 6

page 8

page 9

research
07/27/2020

Unfolding cubes: nets, packings, partitions, chords

We show that every ridge unfolding of an n-cube is without self-overlap,...
research
06/10/2022

Hamiltonian Quasigeodesics yield Nets

This note establishes that every polyhedron that has a Hamiltonian quasi...
research
04/26/2021

Stronger Bounds for Weak Epsilon-Nets in Higher Dimensions

Given a finite point set P in ℝ^d, and ϵ>0 we say that N⊆ℝ^d is a weak ϵ...
research
02/13/2018

Subtyping for Hierarchical, Reconfigurable Petri Nets

Hierarchical Petri nets allow a more abstract view and reconfigurable Pe...
research
07/20/2020

Stabbing Convex Bodies with Lines and Flats

We study the problem of constructing weak -nets where the stabbing eleme...
research
10/08/2018

1-Safe Petri nets and special cube complexes: equivalence and applications

Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net ...
research
06/15/2013

Encoding Higher Level Extensions of Petri Nets in Answer Set Programming

Answering realistic questions about biological systems and pathways simi...

Please sign up or login with your details

Forgot password? Click here to reset