Sciweavers

Share
ICALP
1992
Springer

On Nearest-Neighbor Graphs

11 years 10 months ago
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.
Mike Paterson, F. Frances Yao
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1992
Where ICALP
Authors Mike Paterson, F. Frances Yao
Comments (0)
books