Saturday, November 10 (All Talks in Room GN-F15)    Friday, November 9

9:00-10:10	Session 5
9:00-9:14	A. Mukhopadhyay, E. Greene and D. Chowdhury	On the All-Farthest-Triangles Problem for a Set of Points in 3d
9:14-9:28	A. Satapathy, M. Mukherjee and S. Pal	On the Accessibility problems for robotic arms with multiple stretchable links
9:28-9:42	F. Berger, A. Gruene and R. Klein	How many lions can one man avoid?
9:42-9:56	M. Connor and P. Kumar	Implementing a Parallel Dynamic Approximate Nearest Neighbor Search Algorithm
9:56-10:10	E. Papadopoulou	Higher orer Voronoi diagrams of segments for VLSI critical area extraction
10:10-10:30	Break
10:30-11:30	A. Bobenko (Invited Talk)	Glueing a convex polytope: a constructive proof of Alexandrov's theorem
11:30-12:30	Lunch (Provided, IBM Location TBD)
12:30-1:30	Poster/Multimedia Session II & Break (Cafeteria Annex - setup available from 8:30 AM)
--	M. Mukherjee and K. Chakraborty	Efficient Algorithms for Rectangular Packing and Pattern Fill Problem
--	D. Llanos, D. Orden and B. Palop	Parallelizing non-parallelizable geometric algorithms
--	J. Muckell, M. Andrade and W. Franklin	Drainage Network and Watershed Reconstruction on Simplified Terrain
--	Z. Xie, M. Andrade, W. Franklin, B. Cutler, M. Inanc, D. Tracy and J. Muckell	Approximating Terrain with Over-determined Laplacian PDEs
--	V. Verma and J. Snoeyink	Upending a sphere
--	R. Lass, M. Grauer, E. Sultanik and W. Regli	Decentralized Approach to the Art Gallery Problem
--	A. Lee and L. Theran	Analyzing Rigidity with Pebble Games
--	J. Hugg and D. Souvaine	Research Tools for Data Depth
1:30-2:40	Session 6
1:30-1:44	O. Aichholzer, S. Bereg, A. Dumitrescu, A. Garcia, C. Huemer, F. Hurtado, M. Kano, A. Marquez, S. Smorodinsky, D. Souvaine, J. Urrutia and D. Wood	Compatible Geometric Matchings
1:44-1:58	S. Collette, V. Dujmovic, J. Iacono, S. Langerman and P. Morin	Distribution-Sensitive Point Location in Convex Subdivisions
1:58-2:12	V. Anuradha , C. Jain, J. Snoeyink and T. Szabo	How long can a graph be kept planar?
2:12-2:26	O. Daescu and A. Kurdia	Recognizing minimally rigid graphs in the plane in subquadratic time
2:26-2:40	I. Streinu and L. Theran	Algorithms for area and volume rigidity
2:40-3:00	Break
3:00-4:00	M. Demaine (Invited Talk)	Mathematics is Art
4:00-4:15	Break
4:15-5:25	Session 7
4:15-4:29	J. Itoh, J. O'Rourke and C. Vilcu	Unfolding Convex Polyhedra via Quasigeodesics
4:29-4:43	P. Codenotti and P. Felzenszwalb	2D Min-Filters with Polygons
4:43-4:57	M. Löffler and E. Mumford	Rotating Rectilinear Graphs
4:57-5:11	M. Damian, R. Flatland, J. O'Rourke and S. Ramaswami	Connecting Polygonizations via Stretches and Twangs
5:11-5:25	J. Lenchner	Ordinary Points in Polygons
5:25-5:45	Break
5:45-6:15	Business Meeting