A kdtree is a data structure that makes it possible to quickly solve the nearest neighbor problem. This is a native 2d kdtree suitable for production use with millions of points.

Required Ruby Version

>= 3.0.0

Authors

Adam Doppelt

Versions

  1. 0.5

    1. source

      1. 0.5 source May 01, 2025 (11 KB)
  2. 0.4

    1. source

      1. 0.4 source March 28, 2017 (12 KB)
  3. 0.3

    1. source

      1. 0.3 source October 17, 2012 (11 KB)
  4. 0.1

    1. source

      1. 0.1 source January 22, 2010 (8 KB)

Pushed by

amd

SHA 256 checksum

← Previous version