Program (pdf version)
Friday Oct. 23 (106 O'Brian Hall)
8:30 - 9:25 am : Registration
9:25 - 9：30 am : Opening Remarks
9:30 - 10:45 am : 4 Contributed talks (Session chair: Donald Sheehy)
- Esther Arkin, Jie Gao, Adam Hesterberg, Joseph Mitchell, and Jiemin Zeng :
The Minimum Length Separating Cycle Problem - Ziyun Huang, Danny Chen and Jinhui Xu :
Influence Based Voronoi Diagrams of Clusters - Ge Xia, Iyad Kanj and Eric Sedgwick :
Computing the Flip Distance between Triangulations - Haitao Wang and Jingru Zhang :
Computing the Rectilinear Center of Uncertain Points in the Plane
10:45 - 11:00 am : Coffee break
11:00 – 12:00 pm : Invited talk
- Piotr Indyk :
Beyond Locality Sensitive Hashing
12:00 - 1:30 pm : Lunch
1:30 - 2:45 pm : 4 Contributed talks (Session chair: Xin (Roger) He)
- Mahmoodreza Jahanseir and Donald R. Sheehy :
From Cover Trees to Net-Trees - Nicholas Cavanna, Mahmoodreza Jahanseir and Don Sheehy :
A Geometric Perspective on Sparse Filtrations - Iyad Kanj, Vincent Froese, Andre Nichterlein and Rolf Niedermeier :
Finding Points in General Position - Sandor Fekete, Kan Huang, Joseph Mitchell, Ojas Parekh and Cynthia Phillips :
Geometric Hitting Set for Segments of Few Orientations
2:45 - 3:45 pm : Invited talk
- Kenneth W. Regan :
Using the Shape of Space for Shortcuts: Speeding up regressions on millions of chess positions
3:45 - 4:00 pm : Coffee break
4:00 - 5:15 pm : 4 Contributed talks (Session chair: Jie Gao)
- Elizabeth Munch and Bei Wang :
Reeb Space Approximation with Guarantees - Vin de Silva, Elizabeth Munch and Anastasios Stefanou :
A hom-tree lower bound for the Reeb graph interleaving distance - Marc Khoury, Marc van Kreveld, Bruno Levy and Jonathan Shewchuk :
Restricted Constrained Delaunay Triangulations - Jason S. Ku and Erik D. Demaine :
Efficient Foldings of Convex Polyhedra from Convex Paper
5:15 - 5:30 pm : Coffee break
5:30 - 6:30 pm : Open problems