Prof. Emo Welzl and Prof. Bernd Gärtner
|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
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.
Automatic MiSe System Software Version 1.4803M | admin login