List of papers for presentation

Shortest paths without a map Jie Jun
Navigating in unfamiliar geometric terrain Dan Havey
On spanning trees with low crossing numbers
Delaunay Graphs Are Almost as Good as Complete Graphs Murli
Analyzing Bounding Boxes for Object Intersection Yi Gong
Separation and approximation of polyhedral objects
Asymptotically Optimal Geometric Mobile Ad-Hoc Routing Brett
Geometric Spanners for Routing in Mobile Networks
Online Routing in Triangulations Arijit Khan
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling Gaurav
A Simple Output-Sensitive Algorithm for Hidden Surface Removal Orhun
Backward analysis of randomized geometric algorithms
On the Analysis of Indexing Schemes
Geometric Applications of a randomized optimization technique Luca/Pegah
New upper bounds in Klee's measure problem Lara
Walking Unknown Street with Bounded Detour Adam
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields Steffen and Sharath
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra Shashank
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks