
Session 5 


A. Mukhopadhyay, E. Greene
and D. Chowdhury 
On the
AllFarthestTriangles Problem for a Set of Points in 3d 

A. Satapathy, M. Mukherjee
and S. Pal 
On the Accessibility
problems for robotic arms with multiple stretchable links 

F. Berger, A. Gruene and R.
Klein 
How many lions can one man
avoid? 

M. Connor and P. Kumar 
Implementing a Parallel
Dynamic Approximate Nearest Neighbor Search Algorithm 

E. Papadopoulou 
Higher orer Voronoi
diagrams of segments for VLSI critical area extraction 

Break 


A. Bobenko (Invited
Talk) 
Glueing a convex
polytope: a constructive proof of Alexandrov's theorem 

Lunch (Provided, IBM
Location TBD) 


Poster/Multimedia
Session II & Break (Cafeteria Annex  setup available from 

 
M. Mukherjee and K.
Chakraborty 
Efficient Algorithms for
Rectangular Packing and Pattern Fill Problem 
 
D. Llanos, D. Orden and B. Palop 
Parallelizing
nonparallelizable geometric algorithms 
 
J. Muckell, M. Andrade and W. Franklin 
Drainage Network and
Watershed Reconstruction on Simplified Terrain 
 
Z. Xie, M. Andrade, 
Approximating Terrain with
Overdetermined Laplacian PDEs 
 
V. Verma and J. Snoeyink 
Upending a sphere 
 
R. Lass, M. Grauer, E.
Sultanik and W. Regli 
Decentralized Approach to
the 
 
A. Lee and L. Theran 
Analyzing Rigidity with
Pebble Games 
 
J. Hugg and D. Souvaine 
Research Tools for Data
Depth 

Session 6 


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 

S. Collette, V. Dujmovic,
J. Iacono, S. Langerman and P. Morin 
DistributionSensitive
Point Location in Convex Subdivisions 

V. Anuradha , C. Jain, J.
Snoeyink and T. Szabo 
How long can a graph be
kept planar? 

O. Daescu and A. Kurdia 
Recognizing minimally rigid
graphs in the plane in subquadratic time 

I. Streinu and L. Theran 
Algorithms for area and
volume rigidity 

Break 


M. Demaine (Invited
Talk) 
Mathematics is Art 

Break 


Session 7 


J. Itoh, J. O'Rourke and C.
Vilcu 
Unfolding Convex Polyhedra via Quasigeodesics 

P. Codenotti and P.
Felzenszwalb 
2D MinFilters with
Polygons 

M. Löffler and E. Mumford 
Rotating Rectilinear Graphs 

M. Damian, R. Flatland, J.
O'Rourke and S. Ramaswami 
Connecting Polygonizations
via Stretches and Twangs 

J. Lenchner 
Ordinary Points in Polygons 

Break 


Business Meeting 