Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, October 14, 2014, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Matias Korman (National Institute of Informatics Tokyo)
The geodesic distance between two points p,q in a polygonal domain P is defined as the path of shortest length connecting the two points that contained in P. This distance is a proper metric, and as such the usual concepts of diameter (i.e., points of P that are furthest away) and center (i.e., point whose distance to its furthest away point is minimized) naturally extend. Although computing these traits in simple domains (i.e., domains without holes) is easy, the same does not hold when holes are present in the domain. In this talk we discuss the difficulties that lie in designing algorithms for computing the center and diameter, and how to work around them so as to obtain algorithms that run in polynomial time.
Automatic MiSe System Software Version 1.4803M | admin login