• Parametric Search Made Practical, Rene van Oostrum and Remco C. Veltkamp
• A Local Search Approximation Algorithm for k-Means Clustering, Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine Piatko, Ruth Silverman and Angela Y. Wu
• On the Crossing Number of Complete Graphs, Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser
• On the Number of Embeddings of Minimally Rigid Graphs, Ciprian Borcea and Ileana Streinu

• Deforming Necklaces, Leonidas J. Guibas, An Nguyen, Daniel Russel and Li Zhang
• Efficient Maintenance and Self-Collision Testing for Kinematic Chains, Itay Lotan and Fabian Schwarzer and Dan Halperin and Jean-Claude Latombe
• Box-Trees for Collision Checking in Industrial Installations, H.J. Haverkort and M. de Berg and J. Gudmundsson

 
Nathan Linial, School of Computer Science and Engineering, The Hebrew University of Jerusalem. Finite Metric Spaces -- combinatorics, geometry and algorithms

• Finding the Consensus Shape for a Protein Family, L. Paul Chew and Klara Kedem
• Paper Position Sensing, Marshall Bern and David Goldberg
• A Global Approach to Automatic Solution of Jigsaw Puzzles, David Goldberg and Christopher Malon and Marshall Bern

 
Open problems session

• The Power of Subtraction in Geometric Searching, Bernard Chazelle
• A lower bound on the distortion of embedding planar metrics into Euclidean space, Ilan Newman and Yuri Rabinovich
• The One-Round Voronoi Game, Otfried Cheong, Sariel Har-Peled, Nathan Linial and Jiri Matousek
• Approximate Nearest Neighbor Algorithms for Frechet Distance via Product metrics, Piotr Indyk

• Point-Line Incidences in Space, Micha Sharir and Emo Welzl
• Incidences Between Points and Circles in Three and Higher Dimensions, Boris Aronov, Vladlen Koltun and Micha Sharir
• Lenses in Arrangements of Pseudo-circles and their Applications, Eran Nevo, Janos Pach, Rom Pinchasi, Micha Sharir and Shakhar Smorodinsky

 
Günter Rote, Institute of Computer Science, Freie Universität Berlin. Pseudotriangulations, polytopes, and how to expand linkages

• Guaranteed-Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains, Demian Nave and Nikos Chrisochoides and Paul  Chew
• The Delaunay Tetrahedralization from Delaunay Triangulated Surfaces, Sunghee Choi
• Quickest Paths, Straight Skeletons, and the City Voronoi Diagram, Oswin Aichholzer and Franz Aurenhammer and Belen Palop
• Testing Homotopy for Paths in the Plane, Sergio Cabello, Yuanxin Liu, Andrea Mantler and Jack Snoeyink

• Pseudo Approximation Algorithms, with Applications to Optimal Motion Planning, Tetsuo Asano, David Kirkpatrick and Chee Yap
• Kinetic Maintenance of Context-Sensitive Hierarchical Representations of Disjoint Simple Polygons , David Kirkpatrick and Bettina Speckmann
• Interlocked Open Linkages with Few Joints,  Erik D. Demaine, Stefan Langerman, Joseph O'Rourke and Jack Snoeyink

 
Business meeting

• Conforming Delaunay Triangulations in 3D, David Cohen-Steiner and Eric Colin de Verdiere and Mariette Yvinec
• The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron, Mordecai J. Golin and Hyeon-Suk Na
• Three Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations, Vladlen Koltun and Micha Sharir
• Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions, Vladlen Koltun and Micha Sharir

• Vertex-Unfolding of Simplicial Manifolds, Erik D. Demaine and David Eppstein and Jeff Erickson and George W. Hart and Joseph O'Rourke
• Optimally Cutting a Surface into a Disk, Jeff Erickson and Sariel Har-Peled
• Optimal Decomposition of Polygonal Models into Triangle Strips, Regina Estkowski, Joseph S.B. Mitchell and Xinyu Xiang

 
Peter Schröder, Department of Computer Science, California Institute of Technology. Hybrid meshes: multiresolution using regular and irregular refinement (with I. Guskov, A. Khodakovsky, W. Sweldens)

• Exact Minkowski Sums and Applications, Eyal Flato, Efi Fogel, Dan Halperin, and Eran Leiserowitz
• Homotopy Techniques for Real-Time Visualization of Geometric Tangent Problems, Daniel Kotzor and Thorsten Theobald
• Growing Fat Graphs, Alon Efrat, Stephen Kobourov, Martin Stepp, and Carola Wenk
• AUTO-FOLLOW: Getting a Piece of the Action All the Time, Alexander Bogomjakov and Craig Gotsman
• Adventures of Moebius Band, Stanislav Klimenko, Gregory M. Nielson, Lialia Nikitina, and Igor Nikitin

• Improved Construction of Vertical Decompositions of Three-Dimensional Arrangements, Hayim Shaul and Dan Halperin
• Cost Prediction for Ray Tracing, B. Aronov and H. Bronnimann and A.Y. Chang and Y.-J. Chiang
• Visibility Preserving Terrain Simplification - An Experimental Study, Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell and Yuval Nir
• Projective Clustering in High Dimensions Using Core-Sets, Sariel Har-Peled and Kasturi R. Varadarajan