Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, February 23, 2012, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Michael Hoffmann
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set of N points in the plane into so called pseudo-simultaneously flippable edges and prove a worst-case tight lower bound for the number of such edges in a(ny) triangulation. Using this notion we then derive new upper bounds for the maximal number of crossing-free straight-line graphs that can be embedded on any fixed set of N points in the plane. (joint work with Micha Sharir, Adam Sheffer, Csaba D. Tóth and Emo Welzl)
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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