Skip to content

A kd-tree data structure, for efficiently querying large collections of points in Euclidean space (e.g. for nearest-neighbour searches).

Notifications You must be signed in to change notification settings

allenloves/KDTree

 
 

About

A kd-tree data structure, for efficiently querying large collections of points in Euclidean space (e.g. for nearest-neighbour searches).

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • SuperCollider 55.8%
  • HTML 44.2%