The Library
On nearest-neighbor graphs
Tools
Tools
Tools
UNSPECIFIED. (1997) On nearest-neighbor graphs. DISCRETE & COMPUTATIONAL GEOMETRY, 17 (3). pp. 263-282. ISSN 0179-5376
Full text not available from this repository.Abstract
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.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
| Journal or Publication Title: | DISCRETE & COMPUTATIONAL GEOMETRY |
| Publisher: | SPRINGER VERLAG |
| ISSN: | 0179-5376 |
| Date: | April 1997 |
| Volume: | 17 |
| Number: | 3 |
| Number of Pages: | 20 |
| Page Range: | pp. 263-282 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/17991 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
