Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 14, 2010, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Marek Sulovský
Recently, we looked into the following problem: What is the minimal number obt(n) of obtuse angles (i.e., ordered triples of points in the point set describing an obtuse angle) in a set of n points in the plane R^2. I will summarize several (partial) results we have about obt(n) (it is still work in progress) - an general upper bound construction for obt(n) <~ 2/27 n^3 and several lower bounds for special classes of point sets.
Joint work with R. Pinchasi.
Automatic MiSe System Software Version 1.4803M | admin login