Uniform oriented matroids without the isotopy property Beat JaggiPeter Mani-LevitskaNeil White OriginalPaper 01 March 1989 Pages: 97 - 100
AnO(n logn) algorithm for the all-nearest-neighbors Problem Pravin M. Vaidya OriginalPaper 01 March 1989 Pages: 101 - 115
The complexity of cutting complexes Bernard ChazelleHerbert EdelsbrunnerLeonidas J. Guibas OriginalPaper 01 March 1989 Pages: 139 - 181
Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs F. R. K. Chung OriginalPaper 01 March 1989 Pages: 183 - 190