Computer Science – Computational Geometry
Scientific paper
2007-05-10
Computer Science
Computational Geometry
Full version of abstract that appeared in: Proc. 17th Canad. Conf. Comput. Geom., 2005, pp. 204--207
Scientific paper
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.
Damian Mirela
Flatland Robin
O'Rourke Joseph
No associations
LandOfFree
Unfolding Manhattan Towers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unfolding Manhattan Towers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unfolding Manhattan Towers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-601173