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, December 14, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Marek Sulovský

Obtuse angles: is the flat world being too fat?

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.

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