Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Mittagsseminar Talk Information

Date and Time: Thursday, September 01, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Joseph O'Rourke (Smith College, Northampton, MA, USA)

New Methods for Unfolding Convex Polyhedra

The surface of a convex polyhedron can be cut open and flattened to the plane as a simple polygon. In particular, the unfolding does not self-overlap. So the polygon may be cut out of paper and folded to the convex polyhedron.

It is most natural to restrict the cuts to follow the edges of the polyhedron. It remains an open problem to settle whether or not every convex polyhedron can be cut open to a "net" along edges. Without the edge restriction, there are several methods known to cut open any convex polyhedron to a polygon. I will describe two: one old one, based on an idea of Alexandrov from the 1940's, and a new generalization I obtained in joint work with Jin-ichi Itoh and Costin Vilcu.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login