Unfolding Manhattan Towers
classification
💻 cs.CG
cs.DM
keywords
algorithmmanhattanorthogonaltowersunfoldingalongcallclass
read the original abstract
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1 refinement of the vertex grid.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.