Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, December 12, 2006, 12:15 pm

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

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

**Speaker**: Michael Hoffmann

Let G = (S,E) be a plane straight line graph on a finite point set S subset R^2 in general position. For a point p in S let the maximum incident angle of p in G be the maximum angle between any two edges of G that appear consecutively in the circular order of the edges incident to p. A plane straight line graph is called phi-open if each vertex has an incident angle of size at least phi. We study the following type of question: What is the maximum angle phi such that for any finite set S subset R^2 of points in general position we can find a graph from a certain class of graphs on S that is phi-open? In particular, we determine phi for the classes of triangulations and spanning trees on S.

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