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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, August 29, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Pavel Valtr (Charles Univ., Prague)

Paths with no small angles

Answering a question of Dumitrescu we show that given a finite set of points in the plane, it is possible to connect them to a (possibly self-intersecting) polygonal path so that every angle on the polygonal path is at least $\pi/9$.

Joint work with I. Barany and A. Por.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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