Login / Signup

Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem.

Wenbao QiaoJean-Charles Créput
Published in: Appl. Soft Comput. (2021)
Keyphrases
  • nearest neighbor search
  • cost function
  • dynamic programming
  • objective function
  • exhaustive search
  • parallel implementation
  • databases
  • feature space
  • high dimensional
  • shortest path
  • euclidean distance
  • manhattan distance