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, November 04, 2021, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Daniel Rutschmann

Chain Configurations with many Triangulations

The minimum and maximum number of triangulations of planar point configurations has been extensively studied. Many of the previously considered examples have a very particular geometric structure.

In this talk, I will consider a particular class of configurations, the so-called chains, that captures this geometric structure while also having a nice algebraic description. I will show that one family of chains in particular admits Ω(9.08n) triangulations, improving the previous best configuration that achieved Ω(8.65n) triangulations.

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