On Nearest-Neighbor Graphs

The “nearest-neighbor” relation, or more generally the “k-nearest-neighbors” relation, defined for a set of points in a metric space, has found many uses in computational geometry and clustering analysis, yet surprisingly little is known about some of its basic properties. In this paper we consider some natural questions that are motivated by geometric embedding problems. We derive bounds on the relationship between size and depth for the components of a nearest-neighbor graph and prove some probabilistic properties of the k-nearest-neighbors graph for a random set of points.

[1]  Marshall W. Bern.  Two Probabilistic Results on Rectilinear Steiner Trees , 1986, STOC.

[2]  David Eppstein,et al.  Iterated nearest neighbors and finding minimal polytopes , 1993, SODA '93.

[3]  Kenneth L. Clarkson,et al.  Fast algorithms for the all nearest neighbors problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  J. Matoussek.  Reporting points in halfspaces , 1991, FOCS 1991.

[5]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[6]  Bernard Chazelle,et al.  An optimal convex hull algorithm and new results on cuttings , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[7]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  Jay P. Boris,et al.  A vectorized near neighbors algorithm of order N using a monotonic logical grid , 1986 .

[10]  Paul B. Callahan.  Optimal parallel all-nearest-neighbors using the well-separated pair decomposition , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  David Eppstein,et al.  Algorithms for Proximity Problems in Higher Dimensions , 1995, Comput. Geom..

[12]  S. Rao Kosaraju,et al.  A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version) , 1992, STOC '92.

[13]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees (extended abstract) , 1991, SCG '91.

[14]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[15]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.