On nearest-neighbor graphs

155Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The "nearest-neighbor" relation, or more generally the "k-nearest-neighbors" relations, 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.

Cite

CITATION STYLE

APA

Eppstein, D., Paterson, M. S., & Yao, F. F. (1997). On nearest-neighbor graphs. Discrete and Computational Geometry, 17(3), 263–282. https://doi.org/10.1007/PL00009293

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free