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, November 19, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Marek Sulovský

A few words about continuous motion in geometry

ontinuous motion is proof method in geometry used to prove certain properties of point sets by transforming some "simple" point set (where we know what happens) to an arbitrary point set. The key ingredient to the proof is then controlling the "relevant changes" during this transformation and proving, that the desired property is preserved during these changes.

This technique was successfully used to prove a so called crossing identity for k-edges in the plane [AAHSW'98], which we will use for its illustration. After that, we will state and explain result of similar nature, which we obtained ([SW'*]) by continuous motion for point configurations on a sphere and in R^3.

AAHSW'98: Anrzejak, Aronov, Har-Peled, Seidel, Welzl '98: Results on k-Sets and j-Facets via Continuous Motion (SCG'98)
SW'*: Sulovsky, Wagner: k-Sets and Convex Continuous Motion in R^3 (unpublished)

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