BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Dürer's problem asks whether every 3-polytope P has a net. Is
there always a spanning tree T of its edge graph\, so that if we cut P alon
g T the resulting surface can be unfolded into the plane without self-overl
aps? A common technique in recent works is to fix a spanning tree and then
study the deformations of the corresponding unfolding induced by an affine
stretching or flattening of P. In the first part of my talk I will highligh
t landmark results by Ghomi\, O'Rourke and Tarasov that emanated from this
approach. In the second part I will present my own work on the unfoldabilit
y of nested prismatoids\, which follows a similar ansatz.
DTSTAMP:20220202T175800
DTSTART:20220207T160000
CLASS:PUBLIC
LOCATION:Online via Zoom.
SEQUENCE:0
SUMMARY:Manuel Radons (Technische Universität Berlin): Nearly flat polytope
s in the context of Dürer'\;s problem
UID:107920107@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20220207-C-Radons.html
END:VEVENT
END:VCALENDAR