BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Emo Welzl (ETH Zurich)
DTSTART:20210325T130000Z
DTEND:20210325T140000Z
DTSTAMP:20260423T035825Z
UID:DCGParis/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/DCGParis/4/"
 >Triangulation Flip Graphs of Planar Point Sets</a>\nby Emo Welzl (ETH Zur
 ich) as part of Discrete and Computational Geometry Seminar in Paris\n\n\n
 Abstract\nFull triangulations of a finite planar point set P are maximal s
 traight-line embedded plane graphs on P. In partial triangulations some no
 n-extreme points can be skipped. Flips are minimal changes in triangulatio
 ns. They define an adjacency relation on the set of triangulations of P\, 
 giving rise to the flip graph of all (full or partial) triangulations of P
 . In the seventies Lawson showed that flip graphs are always connected. Ou
 r goal is to investigate the structure of flip graphs\, with emphasis on t
 heir vertex-connectivity. We obtain similar bounds as they follow for regu
 lar triangulations from secondary polytopes via Balinski’s Theorem. Join
 t work with Uli Wagner\, IST Austria\n
LOCATION:https://researchseminars.org/talk/DCGParis/4/
END:VEVENT
END:VCALENDAR