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, April 28, 2016, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Manuel Wettstein

A _wheel set_ is a set of n+1 points in the Euclidean plane, n points in convex position and one extra point which can be placed arbitrarily in the interior. We consider the problem of counting the number of crossing-free geometric graphs on such point sets.

In previous work by Ruiz-Vargas and Welzl, a simple formula was proved for the special case of perfect matchings. We generalize this result to arbitrary families of graphs (triangulations, spanning trees, and more). We further note that the formula only depends on what we call the _frequency vector_ of P and not the whole order type information. While the number of distinct order types for wheel sets is roughly 2^n, the number of frequency vectors is much smaller, namely 2^{n/2}.

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