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: Thursday, October 06, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Joachim Giesen

Critical Point Theory of the Distance to a Point Sample and Applications in Geometric Modeling

Structuring finite point sets is at the heart of computational geometry since such point sets naturally arise in many applications. Examples in three dimensional space are point sets sampled from the surface of a solid or the locations of the atoms in a molecule. A first step in further processing these point sets is to structure them in some data structure. The choice of the data structure of course depends on the application. Structuring the point set into a simplicial complex like the Delaunay triangulation (or its dual the Voronoi diagram) has turned out to be appropriate for many modeling tasks. In a sequence of papers we developed an alternative data structure, proved some of its properties and showed that it is suited for some modeling tasks.

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