
Welcome to the Workshop
and to IBM 


Session 1 


A. Cook and C. Wenk 
Geodesic Fréchet Distance
Inside a Simple Polygon 

O. Daescu and Y. Cheung 
Point to face shortest
paths in R3 

M. Owen 
Linear Algorithm for
Shortest Path Through Select Orthants 

M. Ahmed and A. Lubiw 
Properties of Shortest
Descending Paths 

E. Chambers, E. de
Verdiďre, J. Erickson, S. Lazard, F. Lazarus and S. Thite 
Walking Your Dog in the
Woods in Polynomial Time 

Break 


Session 2 


I. Kanj, L. Perkovic and G.
Xia 
An Optimal Localized
Approximation Scheme for Euclidean MST 

M. Damian, R. Flatland, J.
O'Rourke and S. Ramaswami 
A New Lower Bound on Guard
Placement for Wireless Localization 

X. Zhu, R. Sarkar, J. Gao
and J. Mitchell 
Light weight Contour
Tracking in Wireless Sensor Networks 

R. Sarkar, X. Zhu, J. Gao,
L. Guibas and J. Mitchell 
IsoContour Queries and
Gradient Routing with Guaranteed Delivery in Sensor Networks 

A. BarNoy, T. Brown, M.
Johnson and O. Liu 
Covering With Inexactly
Placed Sensors 

Break 


T. Chan (Invited Talk) 
Computational Geometry
on the Word RAM 

Lunch (Provided  IBM
Cafeteria) 


Session 3 


G. Even, R. Levi, D.
Rawitz, B. Schieber, M. Shahar and M. Sviridenko 
Algorithms for Capacitated
Rectangle Stabbing and 

S. Ahipasaoglu and M. Todd 
Minimum Area Enclosing
Ellipsoidal Cylinder Problem 

A. Dumitrescu and C. Toth 
Analysis of two sweepline
algorithms for spanning trees and Steiner trees 

J. Backer and D.
Kirkpatrick 
An Approximation Algorithm for
General MinimumLength BoundedCurvature Paths 

J. Mitchell and E. Packer 
Computing Geometric
Structures of Low Stabbing Number in the Plane 

Poster/Multimedia
Session I & 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 4 


T. Phillips, G. Miller and
B. Hudson 
Size Complexity of Volume
Meshes vs. Surface Meshes 

G. Swirszcz and T. Maszczyk 
Some remarks on Origami and
its limitations 

J Erickson and P. Worah 
Computing the shortest
essential cycle 

E. Chambers, J. Erickson
and P. Worah 
Testing Contractibility in
Planar Rips Complexes 

E. Packer 
Computing Multiple Watchmen
Routes 

Break 


R. Ghrist (Invited Talk) 
Euler characteristic for
data aggregation 

Break 


Open Problem Session 


Announcement of Winner
of Poster/Multimedia Prize 