Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, January 06, 2015, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Otfried Cheong (KAIST)
Given two convex shapes C and P in the plane, we ask for the homothety of C that best approximates P with respect to the area of their symmetric difference. (In other words, a scaling s and a translation t such that the area of the symmetric difference of P and sC + t is as small as possible.) We show that this problem can be solved by convex programming.
Automatic MiSe System Software Version 1.4803M | admin login