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

Mittagsseminar Talk Information

Date and Time: Thursday, March 31, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Michael Hoffmann

Degree Bounds for Constrained Pseudo-Triangulations

We introduce the concept of a constrained minimum pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G=(S,E). For the case that G forms a simple polygon we give tight bounds on the vertex degree of TG.

(joint work with Oswin Aichholzer, Bettina Speckmann, and Csaba Tóth)

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