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, January 27, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Bettina Speckmann (TU Eindhoven)

The Zigzag Path of a Pseudo-Triangulation

We define the zigzag path of a pseudo-triangulation, a concept generalizing the path of a triangulation of a point set. The pseudotriangulation zigzag path allows us to use divide-and-conquer type of approaches for suitable (i.e., decomposable) problems on pseudo-triangulations. For this we provide an algorithm that enumerates all pseudotriangulation zigzag paths (of all pseudo-triangulations of a given point set with respect to a given line) in O(n^2) time per path and O(n^2) space, where n is the number of points. We illustrate applications of our scheme which include a novel algorithm to count the number of pseudotriangulations of a point set.


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