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: Tuesday, April 12, 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)

Semi-Computability of the Fréchet Distance between Surfaces

The Fréchet distance is a distance measure for parameterized curves and surfaces. For polygonal curves it can be computed in polynomial time, for higher dimensions its computation is known to be NP-hard. We are interested in the Fréchet distance between triangulated surfaces and, using a discrete approximation, we show that it is upper semi-computable, i.e., there is a non-halting Turing machine which produces a monotone decreasing sequence of rationals converging to the result. It follows that the decision problem, whether the Fréchet distance of two given surfaces lies below some specified value, is recursively enumerable.

(Joint work with Helmut Alt)

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