Computational Geometry Seminar

Wednesday, February 28th, 2007, 16:10-18:00

Room 309
Schreiber Building

On the maximum number of edges in k-quasi-planar graphs

Micha Sharir, Tel Aviv University


I will survey several recent results on bounds on the number of certain kinds of repeated patterns, including unit-area triangles, distinct-area triangles, and similar simplices.
Results are by Dumitrescu-Toth, Pinchasi, and our group (Agarwal, Apfelbaum, Purdy, Sharir).