Unfolding Manhattan towers

DOI10.1016/J.COMGEO.2007.07.003MaRDI QIDQ2483556zbMATH OpenOpenAlexFDO

Authors Mirela Damian, Robin Flatland, Joseph O'Rourke

Publication date 28 April 2008

Published in Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

algorithmunfoldinggraphical examplesorthogonal polyhedrongenus-zero

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

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.

Recommendations

• Unfolding H-convex Manhattan towers
• Grid vertex-unfolding orthogonal polyhedra
• Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
• Epsilon-unfolding orthogonal polyhedra
• Unfolding orthogonal polyhedra

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• A survey of folding and unfolding in computational geometry
• Geometric folding algorithms. Linkages, origami, polyhedra
• Grid Vertex-Unfolding Orthostacks

Cited in

(10)

• Introduction to Whitney towers
• On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
• Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra
• Unfolding some classes of orthogonal polyhedra of arbitrary genus
• Unfolding Level 1 Menger Polycubes of Arbitrary Size With Help of Outer Faces
• Unfolding polycube trees with constant refinement
• Unfolding genus-2 orthogonal polyhedra with linear refinement
• Toward unfolding doubly covered \(n\)-stars
• Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
• Unfolding H-convex Manhattan towers

This page was built for publication: Unfolding Manhattan towers

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