DeepAI AI Chat
Log In Sign Up

Unfolding Orthotubes with a Dual Hamiltonian Path

by   Erik D. Demaine, et al.
Princeton University

An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-to-face to form a path. In 1998, Biedl et al. showed that every orthotube has a grid unfolding: a cutting along edges of the boxes so that the surface unfolds into a connected planar shape without overlap. We give a new algorithmic grid unfolding of orthotubes with the additional property that the rectangular faces are attached in a single path – a Hamiltonian path on the rectangular faces of the orthotube surface.


page 1

page 2

page 3

page 4


On Hamiltonian-Connected and Mycielski graphs

A graph G is Hamiltonian-connected if there exists a Hamiltonian path be...

The Hamiltonian Path Graph is Connected for Simple s,t Paths in Rectangular Grid Graphs

A simple s,t path P in a rectangular grid graph 𝔾 is a Hamiltonian path ...

The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs

Supergrid graphs contain grid graphs and triangular grid graphs as their...

4-connected planar graphs are in B_3-EPG

We show that every 4-connected planar graph has a B_3-EPG representation...

Decomposing 4-connected planar triangulations into two trees and one path

Refining a classical proof of Whitney, we show that any 4-connected plan...

An Edge Extrusion-Approach to Generate Extruded Miura-Ori and Its Double Tiling Origami Patterns

This paper proposes a family of origami tessellations called extruded Mi...

Super Compaction and Pluripotent Shape Transformation via Algorithmic Stacking for 3D Deployable Structures

Origami structures enabled by folding and unfolding can create complex 3...