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, June 30, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Otfried Cheong (Korea Advanced Institute of Science and Technology - KAIST, Daejeon, South Korea)

Lines pinning lines

A line $\ell$ is a transversal to a family $F$ of convex polytopes in $\R^3$ if it intersects every member of $F$. If, in addition, $\ell$ is an isolated point of the space of line transversals to $F$, we say $F$ is a pinning of $\ell$. We show that any minimal pinning of a line by polytopes in $\R^3$ such that no face of a polytope is coplanar with the line has size at most eight. If in addition the polytopes are disjoint, then it has size at most six. We completely characterize configurations of disjoint polytopes that form minimal pinnings of a line.

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