Visitar URL original
GitHub - giogadi/kdt: Fast and flexible k-d trees for various types of point queries. · GitHub
Skip to content
giogadiPublic

About

Fast and flexible k-d trees for various types of point queries.

Resources

Stars

25 stars

Watchers

3 watching

Forks

Latest commit

 

History

116 Commits

Folders and files

Repository files navigation

kdt Build Status

Fast and flexible k-d trees for the following point queries:

  • Nearest neighbor
  • all neighbors within given radius
  • k nearest neighbors
  • all neighbors within given range

Check out the documentation on Hackage.

Benchmarks can be found on the wiki.

About

Fast and flexible k-d trees for various types of point queries.

Resources

Stars

25 stars

Watchers

3 watching

Forks

Releases

Packages

Contributors

Languages