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, October 24, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Emo Welzl

Encoding Lattice Triangulations

We consider triangulations of the n by n integer lattice and describe an encoding that shows that there are no more than O(6.85^(n^2)) of those. Via some other encoding we show that the flip graph of these triangulations is a subgraph of the (3n^2 - 2n) -dimensional hypercube (the dimension is tight). Both encodings described build on a basic idea due to Emile Anclin.

Joint work with J. Matousek and P. Valtr.


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