Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, August 14, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Eric Fusy (Laboratoire d'Informatique, LIX, France)
The combinatorial study of plane triangulations with no separating triangle, called irreducible, gives rise to efficient algorithms for the random generation, optimal encoding and straight-line drawing of these triangulations. Simulations indicate that the grid used by the drawing has with high probability a size close to 11n/27 * 11n/27, where n is the number of vertices. As we will see, this can be proved rigorously using tools from bijective combinatorics as well as analytic combinatorics.
Automatic MiSe System Software Version 1.4803M | admin login