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: Thursday, July 07, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Kevin Buchin (FU Berlin)

The Flow Complex: General Structure and Algorithm

The flow complex is a data structure, similar to the Delaunay triangulation, to organize a set of possibly weighted points in Rd. Its structure has been examined in detail in two and three dimensions but only little is known about its structure in general. We present an algorithm for computing the flow complex in any dimension which reflects its recursive structure. On the basis of the algorithm we give a generalized proof of the homotopy equivalence of alpha- and flow-shapes.

This is joint work with Joachim Giesen.

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