| 3 | -- | 16 | David Eppstein. Linear complexity hexahedral mesh generation |
| 17 | -- | 31 | Sandy Irani, Prabhakar Raghavan. Combinatorial and experimental results for randomized point matching algorithms |
| 33 | -- | 44 | Simon Kahan, Jack Snoeyink. On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time |
| 45 | -- | 62 | Gill Barequet, Micha Sharir. Partial surface matching by using directed footprints |
| 63 | -- | 83 | Ernst P. Mücke, Isaac Saias, Binhai Zhu. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations |
| 85 | -- | 103 | Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig. Checking geometric programs or verification of geometric structures |
| 105 | -- | 124 | Satyan R. Coorg, Seth J. Teller. Temporally coherent conservative visibility |
| 125 | -- | 152 | James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia. Visualizing geometric algorithms over the Web |