List of accepted papers for SOCG 2002: Conforming Delaunay Triangulations in 3D David Cohen-Steiner and Eric Colin de Verdiere and Mariette Yvinec Quickest Paths, Straight Skeletons, and the City Voronoi Diagram Oswin Aichholzer and Franz Aurenhammer and Belen Palop 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 The Power of Subtraction in Geometric Searching Bernard Chazelle Finding the Consensus Shape for a Protein Family L. Paul Chew and Klara Kedem Guaranteed-Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains Demian Nave and Nikos Chrisochoides and Paul Chew Vertex-Unfolding of Simplicial Manifolds Erik D. Demaine and David Eppstein and Jeff Erickson and George W. Hart The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron Mordecai J. Golin and Hyeon-Suk Na 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 Box-Trees for Collision Checking in Industrial Installations H.J. Haverkort and M. de Berg and J. Gudmundsson A lower bound on the distortion of embedding planar metrics into Euclidean space Ilan Newman and Yuri Rabinovich Approximate Nearest Neighbor Algorithms for Frechet Distance via Product Metrics Piotr Indyk Efficient Maintenance and Self-Collision Testing for Kinematic Chains Itay Lotan and Fabian Schwarzer and Dan Halperin and Jean-Claude Latombe Optimally Cutting a Surfce 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 Deforming Necklaces Leonidas J. Guibas, An Nguyen, Daniel Russel and Li Zhang Testing Homotopy for Paths in the Plane Sergio Cabello, Yuanxin Liu and Jack Snoeyink Visibility Preserving Terrain Simplification -- An Experimental Study Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell and Yuval Nir Three Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations Vladlen Koltun and Micha Sharir Point-Line Incidences in Space Micha Sharir and Emo Welzl Incidences Between Points and Circles in Three 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 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 AHannes Krasser The One-Round Voronoi Game Otfried Cheong, Sariel Har-Peled, Nathan Linial and Jiri Matousek Parametric Search Made Practical Rene van Oostrum and Remco C. Veltkamp Projective Clustering in High Dimensions Using Core-Sets Sariel Har-Peled and Kasturi R. Varadarajan Interlocked Open Linkages with Few Joints Erik D. Demain, Stefan Langerman, Joseph O'Rourke and Jack Snoeyink Kinetic Maintenance of Context-Sensitive Hierarchical Representations of Disjoint Simple Polygons David Kirkpatrick and Bettina Speckmann On the Number of Embeddings of Minimally Rigid Graphs Ciprian Borcea and Ileana Streinu The Delaunay Tetrahedralization from Delaunay Triangulated Surfaces Sunghee Choi Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions Vladlen Koltun and Micha Sharir Pseudo Approximation Algorithms, with Applications to Optimal Motion Planning Tetsuo Asano, David Kirkpatrick and Chee Yap