Abstract
The nearest neighbor graph (NNG), defined for a set of points in Euclidean space, has found many uses in computational geometry and clustering analysis. Yet there seems to be surprisingly little knowledge about some basic properties of this graph. In this talk, we ask some natural questions that are motivated by geometric embedding problems. For example, in the simulation of many-body systems, it is desirable to map a set of particles to a regular data array so as to preserve neighborhood relations, i.e., to minimize the dilation of NNG. We will derive bounds on the dilation by studying the diameter of NNG. Other properties and applications of NNG will also be discussed. (Joint work with Mike Paterson)
This is a preview of subscription content, log in via an institution.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, F. (1991). Nearest neighbors revisited. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_72
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive