Full versions of the SoCG96, SoCG97, SoCG98 and SoCG99 papers (Sorted by name of 1st author), ...and their authors .

• P. K. Agarwal, J. Basch, M. de Berg, L. J. Guibas and J. Hershberger, Lower Bounds for Kinetic Planar Subdivisions

• Pankaj Agarwal, Boris Aronov, Sariel Har-Peled, and Micha Sharir,
  Approximation and Exact Algorithms for Minimum-Width Annuli and Shells

• Olivier Devillers , On Deletion in Delaunay Triangulation

• Alon Efrat, The Complexity of the Union of (alpha,beta)-Covered Objects

• S.P.Fekete and H.Meijer , On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings

• D. Hsu, L. J. Guibas and Li Zhang, H-Walk: Hierarchical Distance Computation for Moving Convex Bodies

• M. I. Karavelas and L. J. Guibas, Interval Methods for Kinetic Simulations

• M. Pellegrini, A Geometric Approach to Computing Higher Order Form Factors

• M. Gavrilov, P. Indyk, R. Motwani and Suresh Venkatasubramanian, Geometric Pattern Matching: A Performance Study

• János Pach , Joel Spencer and Géza Tóth , New bounds on crossing numbers

• Sigal Raab Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes

• S. A. Wilmarth, N. M. Amato and P. F. Stiller, Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space

• Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel and Emo Welzl,
  Results on k-sets and j-facets via continuous motion arguments.

• Esther M. Arkin, Giri Narasimhan, and Joseph S. B. Mitchell, Resource-Constrained Geometric Network Optimization

• Therese C. Biedl Drawing Planar Partitions I: LL-Drawings and LH-Drawings and Drawing Planar Partitions III: Two constrained embedding problems
  
  

• Olivier Devillers, Improved incremental randomized Delaunay triangulation
  
  

• Alon Efrat and Sariel Har-Peled, Fly Cheaply: On the Minimum Fuel-Consumption Problem.
  


• David Eppstein and Jeff Erickson, Raising roofs, crashing cycles and playing pool: Applications of a data structure for finding pairwise interactions

• Sariel Har-Peled, Constructing Cuttings in Theory and Practice.
  
• Sariel Har-Peled, Constructing Approximate Shortest Path Maps in Three Dimensions.
  
• Sariel Har-Peled, An Output Sensitive Algorithm for Discrete Convex Hulls.

• S.P.Fekete and E. J. Anderson Asymmetric Rendezvous on the Plane

• Géza Tóth and Pavel Valtr , Geometric graphs with few disjoint edges

• Jonathan Richard Shewchuk, A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay Triangulations

• Jonathan Richard Shewchuk, Tetrahedral Mesh Generation by Delaunay Refinement

SoCG97 papers

• Oswin Aichholzer, F. Aurenhammer, D.Z. Chen, D.T. Lee, A. Mukhopadhyay, E. Papadopoulou, Voronoi Diagrams for Direction-Sensitive Distances
• Amashita, Umemoto, Suzuki, Kameda. Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
• Gill Barequet, and Y. Kaplan, A Data Front-end for Layered Manufacturing
• H.Bronnimann and M. Yvinec , Efficient exact evaluation of signs of determinants
• Gill Barequet, S. Bridgeman, C. Duncan, M. T. Goodrich, Roberto Tamassia, Classical Computational Geometry in GeomNet.
• Karl F Bohringer, Bruce Randall Donald and D. halperin, The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields.
• Frederic Cazals ,Bucket-like Space Partitioning Data Structures with Applications to Ray Tracing.
• Jeff Erickson , Space-time tradeoffs for emptiness queries.
• Bernd G"artner , Sven Sch"onherr , Exact Primitives for Smallest Enclosing Ellipses
• Sariel Har-Peled, Approximate Shortest-Path and Geodesic Diameter on Convex Polytopes in Three Dimensions
• Tom Hudson, Dinesh Manocha, Jonathan Cohen, Ming Lin, Kenneth Hoff and Hansong Zhang, Accelerated Occlusion Culling Using Shadow Volumes.
• Gyula Károlyi, János Pach, Géza Tóth, and Pavel Valtr , Ramsey-Type Results for Geometric Graphs. II
• Mark van Kreveld, Chandrajit L. Bajaj, R. van Oostrum, V. Pascucci and D. Schikor, Contour Treesand Small Seed Sets for Isosurface Traversal
• Leif Kobbelt, Robust and Efficient Evaluation of Functionals on Parametric Surface
• Mark Lanthier, Anil Maheshwari and Joerg Sack, Approximating Weighted Shortest Paths on Polyhedral Surfaces
• Liotta, Preparata and R. Tamassia, Robust Proximity Queries: An Illustration of Degree-driven Algorithm Design .
• Victor Milenkovic , Rotational Overlap Minimization
• Matthias Mueller-Hannemann, Karsten Weihe, Minimum Strictly Convex Quadrangulations of Convex Polygons
• Scott A. Mitchell, Choosing corners of rectangles for mapped meshing.
• S.Raghothama and V.Shapiro, Necessary Conditions for Boundary Representation Variance.
• J"org Schwerdt , Michiel Smid and Stefan Schirra, Computing the minimum diameter for moving points: an exact implementation using parametric sear
• Shneerson, A. Tal , GASP-II: A geometric algorithm animation system for an electronic classroom.

SoCG96 papers



• Nina Amenta and G"unter Ziegler , Shadows and Slices of Polytopes
  
  
• Chandrajit L. Bajaj and Valerio Pascucci ,
  Splitting a Complex of Convex Polytopes in any Dimension
  
  
• Gill Barequet,Matthew Dickerson and David Eppstein , On Triangulating Three-Dimensional Polygons
  
  
• Mark de Berg, Mark van Kreveld, Rene van Oostrum and Mark Overmars , Simple Traversal of a Subdivision Without Extra Storage
  
  
• Guy Blelloch, Gary L. Miller and Dafna Talmor, Developing a Practical Projection-Based Parallel Delaunay Algorithm
  
  
• Jean-Daniel Boissonnat and Sylvain Lazard,
  A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles
  
  
• Marek Chrobak, Michael T. Goodrich and Roberto Tamassia, Convex Drawings of Graphs in Two and Three Dimensions
  

• Satyan Coorg and Seth Teller, Temporally Coherent Conservative Visibility
  
  
• Alon Efrat and Alon Itai, Improvements on Bottleneck Matching and Related Problems Using Geometry
  
  
• David Eppstein, Linear Complexity Hexahedral Mesh Generation
  
  
• Stefan Felsner, On the Number of Arrangements of Pseudolines
  
  
• Sariel Har-Peled, Micha Sharir and Kasturi R. Varadarajan,
  Approximate Shortest Paths on a Convex Polytope in Three Dimensions
  
  
• Jeff Erickson, New Lower Bounds for Convex Hull Problems in Odd Dimensions
  


• Gyula Károlyi, János Pach, and Géza Tóth , Ramsey-Type Results for Geometric Graphs. I



• Matya Katz and Franck Nielsen, On piercing set of objects
  


• Scott Mitchell and Steve Vavasis, An aspect ratio bound for triangulating a d-grid cut by a hyperplane



• Ernst P. Mucke, Isaac Saias and Binhai Zhu,
  Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations



• G. Ramkumar, An Algorithm to Compute the Minkowski Sum Outer-Face of Two Simple Polygons



• Kathleen Romanik and Sven Schuierer, Optimal Robot Localization in Trees
  
  
• Micha Sharir and Emo Welzl, Rectilinear and Polygonal $p$-Piercing and $p$-Center Problems"
  
  
• Otfried Schwarzkopf and Micha Sharir,
  Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications
  
  
  
• Micha Sharir, A Near-Linear Algorithm for the Planar 2-Center Problem



• Jonathan Richard Shewchuk Robust Predicates Web page
  


• Daniel A. Spielman and Shang-Hua Teng, Disk Packings and Planar Separators