An algorithm of search of nearest neighbors leading to average computing time per point independent of the total number of points - LARA - Libre accès aux rapports scientifiques et techniques Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1976

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

Résumé

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.
Fichier principal
Vignette du fichier
RP_182-15.pdf (2.35 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02191377 , version 1 (23-07-2019)

Identifiants

  • HAL Id : hal-02191377 , version 1

Citer

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⟩
23 Consultations
23 Téléchargements

Partager

Gmail Facebook X LinkedIn More