Prof. Emo Welzl and Prof. Bernd Gärtner
|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)
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.
Automatic MiSe System Software Version 1.4803M | admin login