On plane geometric spanners: A survey and open problems

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Sunil Arya, David M. Mount, Nathan S. Netanyahu et al. · Journal of the ACM · 1998 · 2.3K citations · Full text

Computational Complexity Theory, Engineering, Computational Complexity +19

Spatial Tessellations: Concepts and Applications of Voronoi Diagrams

Marjorie Senechal, Atsuyuki Okabe, Barry Boots et al. · College Mathematics Journal · 1995 · 784 citations

Geometric Modeling, Cartography, Geometric Algorithm +7

Relative neighborhood graphs and their relatives

Jerzy W. Jaromczyk, Godfried T. Toussaint · Proceedings of the IEEE · 1992 · 667 citations

Engineering, Network Analysis, Data Science +20

Classes of graphs which approximate the complete euclidean graph

Julian Keil, Carl Gutwin · Discrete & Computational Geometry · 1992 · 360 citations · Full text

Geometric Graph Theory, Graph Theory, Planar Graph +7

There are planar graphs almost as good as the complete graph

L. Paul Chew · Journal of Computer and System Sciences · 1989 · 270 citations

Geometric Graph Theory, Network Science, Graph Theory +11