| 9:00 - 9:20 | Sariel
Har-Peled, University of Illinois, Urbana Shape fitting with outliers |
| 9:25 - 9:40 | Erik Demaine, MIT, Cambridge Instance-optimal algorithms for black-box curve manipulation |
| 9:45 - 10:05 | Steven Fortune, Bell Labs, Murray Hill
Iterative conditioning as a design methodology for robust predicates on curved objects |
| 10:00 Coffee break | |
| 10:40 - 11:00 | Bernard Chazelle, Princeton University Sublinear geometric algorithms |
| 11:05 - 10:20 | Lutz Kettner, Max-Planck-Institut für Informatik Boolean operations on 3d surfaces using Nef polyhedra |
| 11:25 - 11:40 | Joseph
S. Mitchell, SUNY at Stony Brook Touring a first subsequence of polygons |
| 11:45 - 12:00 | Alon Efrat, University of Arizona, Tucson Touring the second subsequence of polygons |
| 12:15 Lunch; 15:30 Coffee and Cake | |
| 16:00 - 16:20 | Piotr Indyk, MIT, Cambridge Nearest neighbor under edit distance via product metric |
| 16:25 - 16:45 | Chee K. Yap,
Courant Institute, New York Pseudo-approximation algorithms |
| 16:50 - 17:05 | Stefan Funke, Max-Planck-Institut für Informatik Energy-minimizing k-hop paths in wireless networks |
| 17:15 - 17:35 | Sunghee Choi, University of Texas at Austin Incremental constructions con BRIO |
| 17:40 - 18:00 | Ferran Hurtado, Universitat Politecnica de Catalunya Playing with triangulations |
| 18:00 Dinner | |