scientific article; zbMATH DE number 7829473

arXiv2201.12452MaRDI QIDQ6126513

Kritkorn Karntikoon, Erik D. Demaine

Publication date: 9 April 2024

Full work available at URL: https://arxiv.org/abs/2201.12452

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmHamiltonicityunfolding polyhedraorthotubes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete geometry (52C99)

Cites Work

• Unnamed Item
• Unfolding genus-2 orthogonal polyhedra with linear refinement
• Ununfoldable polyhedra with convex faces
• Unfolding polycube trees with constant refinement
• Epsilon-unfolding orthogonal polyhedra
• Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
• On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Unfolding Orthogonal Polyhedra with Linear Refinement
• A theorem on paths in planar graphs
• Unfolding some classes of orthogonal polyhedra of arbitrary genus

This page was built for publication: