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, May 23, 2024, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Patrick Schnider
Given a family of convex sets in the plane, we would like to stab them using lines. That is, we want to find a set of lines such that every convex set is intersected by at least one of the lines. Under what conditions is a single line sufficient for this? When is a constant number of lines enough? These type of questions are classical and fundamental problems in geometric transversal theory. I will give a short historical overview of the most important results, culminating in a recent result by McGinnis and Zerbib, who solved a conjecture from Eckhoff from the 70s. If time permits, I also talk about my ongoing work in this area.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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