Polyhedral Characterization of Reversible Hinged Dissections

03/03/2018
by   Jin Akiyama, et al.
0

We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between A and B) if and only if A and B are two non-crossing nets of a common polyhedron. Furthermore, monotone hinged dissections (where all hinges rotate in the same direction when changing from A to B correspond exactly to non-crossing nets of a common convex polyhedron. By envelope/parcel magic, it becomes easy to design many hinged dissections.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2023

Relating Reversible Petri Nets and Reversible Event Structures, categorically

Petri nets, where causal dependencies are modelled via inhibitor arcs, c...
research
10/24/2019

Reversible Causal Nets and Reversible Event Structures

One of the well-known results in concurrency theory concerns the relatio...
research
04/06/2023

Reversible and Reversible Complement Cyclic codes over a class of non-chain rings

In this paper, necessary and sufficient conditions for a cyclic code of ...
research
04/10/2018

Reversible Computation in Petri Nets

Reversible computation is an unconventional form of computing where any ...
research
10/07/2020

Reversible Computation in Cyclic Petri Nets

Petri nets are a mathematical language for modeling and reasoning about ...
research
08/04/2021

Acyclic and Cyclic Reversing Computations in Petri Nets

Reversible computations constitute an unconventional form of computing w...
research
06/12/2023

A toy model provably featuring an arrow of time without past hypothesis

The laws of Physics are time-reversible, making no qualitative distincti...

Please sign up or login with your details

Forgot password? Click here to reset