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, July 21, 2015, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Micha Sharir (Tel Aviv University)

A new look at rigidity

We note that the problem of testing for the rigidity of a straight-edge embedding of a graph in the plane can be transformed into a problem involving contacts between lines in three dimensions, using Elekes's transformation (that has been a major component of Guth and Katz's work on distinct distances). This works both ways: By studying the contact patterns of lines in space, we are able to derive new proofs, with stronger characterizations, for the rigidity (or lack thereof) of certain types of graphs (e.g., complete bipartite graphs). On the other hand, results and questions about rigidity translate to interesting properties of lines in space.

Joint work with Orit E. Raz.


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