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, November 24, 2005, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Emo Welzl

Given a set of *n* points in the plane, we consider triangulations
drawn uniformly at random from all triangulations of the point set,
and we derive bounds (in terms of *n*) on the expected number of
vertices of given degree *k*, for *k=3,4,...*.
For degree 3 vertices, lower and upper bounds are *n/43* and *2n/5*, respectively (note
that the number of degree 3 vertices in a triangulation may vary
between 0 and 2n/3).
We also show how these bounds can be employed to infer an
upper bound on the number of triangulations *n* points can have,
improving on previous work by Santos and Seidel.

(Joint work with Micha Sharir.)

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 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