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, 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: Maike Buchin (FU Berlin)

Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard

Given a set of points sampled from a surface in R3 we want to find a "good" triangulation of the points in the sense that the triangulation resembles the underlying surface. This can be done by locally minimizing a given cost function. One such cost function is the total absolute discrete Gaussian curvature. Alboul and van Damme first suggested this for post-processing of polyhedral surfaces using a simple flip heuristic. This heuristic however can get stuck in local minima and it remained an open question, whether an efficient algorithm exists which always finds the global minimum. In this talk we show that, in the case of terrains, minimizing the total absolute Gaussian curvature is NP-hard.

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:   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