An algorithm of search of nearest neighbors leading to average computing time per point independent of the total number of points

Abstract : A new algorithm of search of nearest neighbors is proposed. It is based upon the partition of the vorking domain in cells. It presents two major characteristics. First, the average number of distance calculations can be done as small as required. Secondly, the average computing time per point is indépendant of the total number of points to be classified. The theoretical behavior has been studied for a uniform distribution in a plan. Experimental verifications are provided.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02191377
Contributor : Colette Orange <>
Submitted on : Tuesday, July 23, 2019 - 2:37:07 PM
Last modification on : Wednesday, July 24, 2019 - 1:14:20 AM

File

RP_182-15.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02191377, version 1

Collections

Citation

Claude Delannoy. An algorithm of search of nearest neighbors leading to average computing time per point independent of the total number of points. [Research Report] Note technique CRPE n° 36, Centre de recherches en physique de l'environnement terrestre et planétaire (CRPE). 1976, 22 p., graphiques. ⟨hal-02191377⟩

Share

Metrics

Record views

1

Files downloads

3