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: Tuesday, November 25, 2003, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Michael Hoffmann

Pointed Encompassing Trees

For any set of n disjoint line segments in the plane there exists a binary spanning tree on the segment endpoints in which all segments appear as edges. Moreover, the tree can be constructed in such a way that every vertex is pointed, that is, all edges incident to a vertex lie in a halfplane whose defining line passes through the vertex.

I will discuss this theorem, mention a few related results, and show how it can be applied to obtain a constant (vertex-)degree bound for pseudotriangulations of disjoint line segments.


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