Unfolding Orthotubes with a Dual Hamiltonian Path

01/28/2022
by   Erik D. Demaine, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2022

On Hamiltonian-Connected and Mycielski graphs

A graph G is Hamiltonian-connected if there exists a Hamiltonian path be...
research
05/16/2022

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 ...
research
04/04/2019

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...
research
10/12/2017

4-connected planar graphs are in B_3-EPG

We show that every 4-connected planar graph has a B_3-EPG representation...
research
02/23/2022

Matching Theory and Barnette's Conjecture

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipart...
research
02/11/2020

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

For many algorithmic problems on graphs of treewidth t, a standard dynam...
research
10/10/2018

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...

Please sign up or login with your details

Forgot password? Click here to reset