AnO(n logn) algorithm for the all-nearest-neighbors Problem

Computational geometry. an introduction

Franco P. Preparata, Michael Ian Shamos · 1985 · 2.4K citations

Natural Sciences, Computer Science, Mathematics +8

Multidimensional divide-and-conquer

Jon Bentley · Communications of the ACM · 1980 · 676 citations · Full text

Computing, Computer Science, Algorithmic Design +11

Lower bounds for algebraic computation trees

Michael Ben-Or · 1983 · 527 citations · Full text

Natural Sciences, Computer Science, Mathematics +13

Scaling and related techniques for geometry problems

Harold N. Gabow, Jon Bentley, Robert E. Tarjan · 1984 · 526 citations

Computing, Computer Science, Computational Geometry +15

Combinatorial Algorithms: Theory and Practice.

Tony Greenfield, Edward M. Reingold, Jurg Nievergeld et al. · Journal of the Royal Statistical Society Series D (The Statistician) · 1978 · 428 citations

Natural Sciences, Computer Science, Mathematics +12