Unfolding Manhattan Towers

Simple item page
dc.creatorDamian, Mirela
dc.creatorFlatland, Robin
dc.creatorO'Rourke, Joseph
dc.date2007-05-10
dc.date.accessioned2026-07-07T08:00:44Z
dc.date.available2026-07-07T08:00:44Z
dc.descriptionWe 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.
dc.descriptionFull version of abstract that appeared in: Proc. 17th Canad. Conf. Comput. Geom., 2005, pp. 204--207
dc.identifierhttps://arxiv.org/abs/0705.1541
dc.identifierhttp://arxiv.org/abs/0705.1541
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128744
dc.subjectComputational Geometry
dc.subjectDiscrete Mathematics
dc.subjectF.2.2
dc.titleUnfolding Manhattan Towers
dc.typetext

Files

Collections

arXiv