| 99 | -- | 105 | Jianbo Qian, Cao An Wang. Progress on maximum weight triangulation |
| 106 | -- | 114 | Christopher J. Hillar, Darren L. Rhea. A result about the density of iterated line intersections in the plane |
| 115 | -- | 129 | Ovidiu Daescu, Jun Luo, David M. Mount. Proximity problems on line segments spanned by points |
| 130 | -- | 138 | Siu-Wing Cheng. On the sizes of Delaunay meshes |
| 139 | -- | 151 | Mark de Berg, Micha Streppel. Approximate range searching using binary space partitions |
| 152 | -- | 164 | Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron. Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets |
| 165 | -- | 173 | Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer. A linear time algorithm to remove winding of a simple polygon |
| 174 | -- | 185 | Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff. Farthest-point queries with geometric and combinatorial constraints |