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: Thursday, May 03, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Jiří Matoušek (Charles Univ., Prague)

How many points can be reconstructed from k projections?

Let A be an n-point set in the plane. A discrete X-ray of A in direction u gives the number of points of A on each line parallel to u. We define F(k) as the maximum number n such that there exist k directions u_1,...,u_k such that every set of at most n points in the plane can be uniquely reconstructed from its discrete X-rays in these directions. We establish a mildly exponential lower bound F(k)>2^((k/2)^(1/3)).

Joint work with Aleš Přívětivý and Petr Škovroň.

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