• ANN

  • Referenced in 45 articles [sw09854]
  • different data structures, based on kd-trees and box-decomposition trees, and employs a couple...
  • Vlfeat

  • Referenced in 44 articles [sw13478]
  • extractors, (hierarchical) k-means clustering, randomized kd-tree matching, and super-pixelization. The source code...
  • FNN

  • Referenced in 12 articles [sw14860]
  • Algorithms and Applications. Cover-tree and kd-tree fast k-nearest neighbor search algorithms...
  • GAPS

  • Referenced in 14 articles [sw02613]
  • both convex and non-convex clusters. Kd-tree based nearest neighbor search is used...
  • dbscan

  • Referenced in 8 articles [sw16291]
  • factor) algorithm. The implementations uses the kd-tree data structure (from library ANN) for faster...
  • nanoflann

  • Referenced in 8 articles [sw22685]
  • header-only library for building KD-Trees of datasets with different topologies: R2, R3 (point...
  • biOps

  • Referenced in 2 articles [sw08208]
  • classification methods are also provided (standard, kd-tree and brute force methods implemented). Fast Fourier...
  • NanoNET

  • Referenced in 2 articles [sw35709]
  • framework implements a method based on kd-tree nearest-neighbour search and is applicable...
  • VirtuaSchlieren

  • Referenced in 1 article [sw29131]
  • screen plane. To this purpose, kd-tree search algorithms are implemented to retrieve the position ... nearest neighbor (ANN) and a simplified kd-tree search technique. The latter is implemented...
  • libkdtree++

  • Referenced in 1 article [sw05587]
  • dimensional space sorting, using a kd-tree. It sports a theoretically unlimited number of dimensions...
  • RapidPolygonLookup

  • Referenced in 1 article [sw24246]
  • trees. Facilitates efficient polygon search using kd trees. Coordinate level spatial data can be aggregated ... computationally expensive. Here, we exploit kd-trees as efficient nearest neighbor search algorithm to dramatically...
  • Loess.jl

  • Referenced in 1 article [sw37221]
  • loess implementation, based on the fast kd-tree based approximation described in the original Cleveland...
  • OpenSIFT

  • Referenced in 1 article [sw16553]
  • matching SIFT features between images using kd-trees, and computing geometrical image transforms from feature...
  • CGAL

  • Referenced in 370 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • LAPACK

  • Referenced in 1654 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • J-MEANS

  • Referenced in 69 articles [sw02649]
  • J-MEANS: A new local search heuristic for...
  • GAKREM

  • Referenced in 10 articles [sw02712]
  • GAKREM: A novel hybrid clustering algorithm We introduce...
  • UCI-ml

  • Referenced in 3160 articles [sw04074]
  • UC Irvine Machine Learning Repository. We currently maintain...
  • Stony Brook

  • Referenced in 85 articles [sw05040]
  • The Stony Brook Algorithm Repository mainly for combinatorial...