| On the difficulty of triangulating three-dimensional nonconvex polyhedra. | 55 | 4.86 | 1992 |
| Slimming down by adding; selecting heavily covered points | 12 | 4.10 | 1990 |
| On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra | 23 | 3.01 | 1989 |
| Computing the link center of a simple polygon | 36 | 3.48 | 1987 |
| On the number of faces in higher-dimensional Voronoi diagrams | 7 | 2.63 | 1987 |
| Computing convolutions by reciprocal search | 94 | 17.38 | 1986 |
