Epsilon-Unfolding Orthogonal Polyhedra
Mirela Damian, Robin Flatland, Joseph O'Rourke
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/2Omega(n).
Create a lesson
Related papers
Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs
Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier et al.
Quadratic Complexity of Voronoi Diagrams in R3 for Lines in a Single Ruling of a Regulus
Eunku Park
Sequential Euclidean tree construction with exponential memory: distributional performance and worst-case guarantees
Pedro M. M. de Castro
Computing an e-net of a closed hyperbolic surface
Vincent Delecroix, Vincent Despré, Camille Lanuel et al.
On Angle-optimization and Simplification of Degree-1 Homology Representatives
Emerson G. Escolar, Yuta Shimada
Riesz Energy Subset Selection in the Euclidean Plane is NP-Hard: A Reduction from the Ising Model on Planar Cubic Graphs
Michael Emmerich