SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS (Q4030349)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 147354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS |
scientific article; zbMATH DE number 147354 |
Statements
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS (English)
0 references
1 April 1993
0 references
enumeration
0 references
selection
0 references
nearest neighbors
0 references
Delaunay triangulation
0 references
0.8834366202354431
0 references
0.8834366202354431
0 references
0.8396865725517273
0 references
0.828526496887207
0 references
0.8165841698646545
0 references
