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, August 14, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Eric Fusy (Laboratoire d'Informatique, LIX, France)

On a family of plane triangulations: combinatorial study, straight-line drawing, and analysis

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.


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