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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 15, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Meghana M. Reddy

Topological Drawings meet Classical Theorems from Convex Geometry

Classical theorems from Convex Geometry like Kirchberger’s, Radon’s, Helly’s and Carathéodory’s theorems can be studied in the context of simple topological drawings and in terms of convexity hierarchy of topological drawings. Specifically, Carathéodory’s theorem and Kirchberger’s theorem can be extended to simple topological drawings of $K_n$ and Helly’s theorem does not hold for simple topological drawings. In this talk, we look at Carathéodory’s and Helly’s theorem. This work was published by Bergold et al. in Graph Drawing 2020.

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