Epsilon-unfolding orthogonal polyhedra

DOI10.1007/S00373-007-0701-8MaRDI QIDQ2373431zbMATH OpenOpenAlexWikidataFDO

Authors Mirela Damian, Robin Flatland, Joseph O'Rourke

Publication date 19 July 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

General unfoldingGenus zeroGrid unfoldingOrthogonal polyhedra

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron may be unfolded. Here we prove, via an algorithm, that every orthogonal polyhedron (one whose faces meet at right angles) of genus zero may be unfolded. Our cuts are not necessarily along edges of the polyhedron, but they are always parallel to polyhedron edges. For a polyhedron of n vertices, portions of the unfolding will be rectangular strips which, in the worst case, may need to be as thin as epsilon = 1/2^{Omega(n)}.

Recommendations

• Unfolding orthogonal polyhedra
• Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
• Grid Vertex-Unfolding Orthogonal Polyhedra
• Unfolding genus-2 orthogonal polyhedra with linear refinement
• Ununfoldable polyhedra with convex faces

Cites work

• A survey of folding and unfolding in computational geometry
• Grid Vertex-Unfolding Orthogonal Polyhedra
• Grid Vertex-Unfolding Orthostacks
• scientific article; zbMATH DE number 2068107 (Why is no real title available?)

Cited in

(30)

• An exposition of Poincaré's polyhedron theorem
• Unfolding genus-2 orthogonal polyhedra with linear refinement
• Unfolding \(3\)-separated polycube graphs of arbitrary genus
• Ununfoldable polyhedra with \(6\) vertices or \(6\) faces
• Unfolding polycube trees with constant refinement
• Refold rigidity of convex polyhedra
• Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
• Edge-unfolding nested polyhedral bands
• Grid vertex-unfolding orthogonal polyhedra
• Unfolding Manhattan towers
• Toward unfolding doubly covered n-stars
• On edge-unfolding one-layer lattice polyhedra with cubic holes
• On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
• Unfolding orthogonal polyhedra
• A computational approach to the determination of nets
• scientific article; zbMATH DE number 5542495 (Why is no real title available?)
• Polyhedra with no natural unfoldings
• Vertex-unfoldings of simplicial manifolds
• Affine unfoldings of convex polyhedra
• scientific article; zbMATH DE number 1404446 (Why is no real title available?)
• Edge-unfolding nearly flat convex caps
• Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra
• Grid Vertex-Unfolding Orthogonal Polyhedra
• Unfolding some classes of orthogonal polyhedra of arbitrary genus
• Unfolding some classes of orthogonal polyhedra of arbitrary genus
• Edge-unfolding nested prismatoids
• Unfolding orthotubes with a dual Hamiltonian path
• Continuous blooming of convex polyhedra
• Edge-unfolding polycubes with orthogonally convex layers
• Vertex unfoldings of tight polyhedra

This page was built for publication: Epsilon-unfolding orthogonal polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373431)