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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, September 26, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Raimund Seidel (Saarland University)

An Aggregative Counting Algorithm for the Triangulations of a Planar Point Set

Let $t(P)$ be the number of straight edge triangulations of a planar point set $P$. It is known that $t(P)\geq \Omega(2.4^n)$, where $n=|P|$. We give an algorithm that computes $t(P)$ in time $O(n^2 2^n)$. Thus the algorithm is ``aggregative'' in the sense that it determines the cardinality of a set substantially faster than by enumerating the elements.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  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