kd-tree 0.0.3

data/.document

@@ -0,0 +1,5 @@
+lib/**/*.rb
+bin/*
+- 
+features/**/*.feature
+LICENSE.txt

data/.rspec

@@ -0,0 +1 @@
+--color

data/.rvmrc

@@ -0,0 +1 @@
+rvm use 1.9.2-patched@kdtree

data/Gemfile

@@ -0,0 +1,13 @@
+source "http://rubygems.org"
+# Add dependencies required to use your gem here.
+# Example:
+#   gem "activesupport", ">= 2.3.5"
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+  gem "rspec", "~> 2.3.0"
+  gem "bundler", "~> 1.0.0"
+  gem "jeweler", "~> 1.6.4"
+  gem "rcov", ">= 0"
+end

data/Gemfile.lock

@@ -0,0 +1,28 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    diff-lcs (1.1.3)
+    git (1.2.5)
+    jeweler (1.6.4)
+      bundler (~> 1.0)
+      git (>= 1.2.5)
+      rake
+    rake (0.9.2)
+    rcov (0.9.10)
+    rspec (2.3.0)
+      rspec-core (~> 2.3.0)
+      rspec-expectations (~> 2.3.0)
+      rspec-mocks (~> 2.3.0)
+    rspec-core (2.3.1)
+    rspec-expectations (2.3.0)
+      diff-lcs (~> 1.1.2)
+    rspec-mocks (2.3.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.0.0)
+  jeweler (~> 1.6.4)
+  rcov
+  rspec (~> 2.3.0)

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2011 Jeremy Holland
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.rdoc

@@ -0,0 +1,19 @@
+= kdtree
+
+Description goes here.
+
+== Contributing to kd-tree
+
+* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet
+* Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it
+* Fork the project
+* Start a feature/bugfix branch
+* Commit and push until you are happy with your contribution
+* Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
+
+== Copyright
+
+Copyright (c) 2011 Jeremy Holland. See LICENSE.txt for
+further details.
+

data/Rakefile

@@ -0,0 +1,49 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'rake'
+
+require 'jeweler'
+Jeweler::Tasks.new do |gem|
+  # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
+  gem.name = "kd-tree"
+  gem.homepage = "http://github.com/awebneck/kdtree"
+  gem.license = "MIT"
+  gem.summary = %Q{A pure-ruby kd-tree implementation}
+  gem.description = %Q{Great for nearest neighbor search in k dimensions! (as long as k is reasonable)}
+  gem.email = "jeremy@jeremypholland.com"
+  gem.authors = ["Jeremy Holland"]
+  # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rspec/core'
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new(:spec) do |spec|
+  spec.pattern = FileList['spec/**/*_spec.rb']
+end
+
+RSpec::Core::RakeTask.new(:rcov) do |spec|
+  spec.pattern = 'spec/**/*_spec.rb'
+  spec.rcov = true
+end
+
+task :default => :spec
+
+require 'rake/rdoctask'
+Rake::RDocTask.new do |rdoc|
+  version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "kd-tree #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/VERSION

@@ -0,0 +1 @@
+0.0.3

data/kd-tree.gemspec

@@ -0,0 +1,64 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = "kd-tree"
+  s.version = "0.0.3"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Jeremy Holland"]
+  s.date = "2011-10-04"
+  s.description = "Great for nearest neighbor search in k dimensions! (as long as k is reasonable)"
+  s.email = "jeremy@jeremypholland.com"
+  s.extra_rdoc_files = [
+    "LICENSE.txt",
+    "README.rdoc"
+  ]
+  s.files = [
+    ".document",
+    ".rspec",
+    ".rvmrc",
+    "Gemfile",
+    "Gemfile.lock",
+    "LICENSE.txt",
+    "README.rdoc",
+    "Rakefile",
+    "VERSION",
+    "kd-tree.gemspec",
+    "lib/kd-tree.rb",
+    "lib/kd_tree.rb",
+    "lib/kd_tree/hyper_rect.rb",
+    "lib/kd_tree/point.rb",
+    "spec/kd_tree_spec.rb",
+    "spec/spec_helper.rb"
+  ]
+  s.homepage = "http://github.com/awebneck/kdtree"
+  s.licenses = ["MIT"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = "1.8.10"
+  s.summary = "A pure-ruby kd-tree implementation"
+
+  if s.respond_to? :specification_version then
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_development_dependency(%q<rspec>, ["~> 2.3.0"])
+      s.add_development_dependency(%q<bundler>, ["~> 1.0.0"])
+      s.add_development_dependency(%q<jeweler>, ["~> 1.6.4"])
+      s.add_development_dependency(%q<rcov>, [">= 0"])
+    else
+      s.add_dependency(%q<rspec>, ["~> 2.3.0"])
+      s.add_dependency(%q<bundler>, ["~> 1.0.0"])
+      s.add_dependency(%q<jeweler>, ["~> 1.6.4"])
+      s.add_dependency(%q<rcov>, [">= 0"])
+    end
+  else
+    s.add_dependency(%q<rspec>, ["~> 2.3.0"])
+    s.add_dependency(%q<bundler>, ["~> 1.0.0"])
+    s.add_dependency(%q<jeweler>, ["~> 1.6.4"])
+    s.add_dependency(%q<rcov>, [">= 0"])
+  end
+end
+

data/lib/kd-tree.rb

@@ -0,0 +1 @@
+require "#{File.dirname(__FILE__)}/kd_tree"

data/lib/kd_tree.rb

@@ -0,0 +1,102 @@
+require File.dirname(__FILE__)+'/kd_tree/point'
+require File.dirname(__FILE__)+'/kd_tree/hyper_rect'
+
+class KDTree
+  attr_accessor :exemplar, :split, :kd_left, :kd_right
+
+  def initialize(exemplar_set)
+    return if exemplar_set.empty?
+    exemplar_set = extract_pivot exemplar_set
+    split! exemplar_set
+  end
+
+  def extract_pivot(exemplar_set)
+    k = exemplar_set[0].length - 1
+    max_spread = -Float::INFINITY
+    max_spread_o = 0
+    max_spread_d = 0
+    k.times do |i|
+      min = Float::INFINITY
+      max = -Float::INFINITY
+      exemplar_set.each do |ex|
+        min = ex[k] if ex[k] < min
+        max = ex[k] if ex[k] > max
+      end
+      if max - min > max_spread
+        max_spread = max - min
+        max_spread_o = min
+        max_spread_d = i
+      end
+    end
+    @split = max_spread_d
+    mid_coord = max_spread_o + (max_spread/2.0)
+    split_d_coords = exemplar_set.map do |ex|
+      ex[split]
+    end
+    mid_closest_coord = Float::INFINITY
+    mid_closest_index = 0
+    split_d_coords.each_with_index do |coord, i|
+      if (coord - mid_coord).abs < mid_closest_coord
+        mid_closest_coord = coord
+        mid_closest_index = i
+      end
+    end
+    @exemplar = exemplar_set.delete_at mid_closest_index
+    exemplar_set
+  end
+
+  def split!(exemplar_set)
+    left_set = []
+    right_set = []
+    exemplar_set.each do |ex|
+      if ex[@split] <= @exemplar[@split]
+        left_set << ex
+      else
+        right_set << ex
+      end
+    end
+    @kd_left = self.class.new left_set
+    @kd_right = self.class.new right_set
+  end
+
+  def nearest_neighbor(target, metric=:euclidean)
+    nearest_neighbors(target, 1, metric)[0]
+  end
+
+  def cut_kspace_by(target, hr)
+    hrl, hrr = hr.cut @split, @exemplar[@split]
+    if target[@split] <= @exemplar[@split]
+      [@kd_left, hrl, @kd_right, hrr]
+    else
+      [@kd_right, hrr, @kd_left, hrl]
+    end
+  end
+
+  def nearest_neighbors(target, n, metric=:euclidean, acc=[], hr=HyperRect.new(target.length), max_dist=Float::INFINITY)
+    return acc if @exemplar.nil?
+    nearer_kd, nearer_hr, further_kd, further_hr = self.cut_kspace_by target, hr
+    acc = nearer_kd.nearest_neighbors target, n, metric, acc, nearer_hr, max_dist
+    max_dist = acc.last[:dist] if acc.length == n && acc.last[:dist] < max_dist
+    acc = backtrack_check target, n, metric, acc, further_hr, max_dist, further_kd
+    acc.sort_by { |node| node[:dist] }
+  end
+
+  def backtrack_check(target, n, metric, acc, hr, max_dist, kd)
+    if hr.intersects? target, max_dist, metric
+      dist = @exemplar.distance_from(target, metric)
+      if acc.length < n || dist < acc.last[:dist]
+        acc = acc.clone
+        max_dist = dist if acc.length == n
+        acc << {:node => @exemplar, :dist => dist}
+        acc = acc.sort_by { |node| node[:dist] }
+        acc.delete_at n if acc.length > n
+      end
+      temp_acc = kd.nearest_neighbors target, n, metric, acc, hr, max_dist
+      if ((temp_acc.length > 0) && (acc.length < n || temp_acc.last[:dist] < acc.last[:dist]))
+        acc = temp_acc
+      end
+    end
+    acc
+  end
+end
+

data/lib/kd_tree/hyper_rect.rb

@@ -0,0 +1,43 @@
+class KDTree
+  class HyperRect
+    attr_accessor :minima, :maxima
+    def initialize(k)
+      @minima = []
+      @maxima = []
+      k.times do |i|
+        @minima << -Float::INFINITY
+        @maxima << Float::INFINITY
+      end
+    end
+
+    def clone
+      cl = self.class.new @minima.length
+      cl.minima = @minima.clone
+      cl.maxima = @maxima.clone
+      cl
+    end
+
+    def cut(dim, pivot)
+      left_hr = self.clone
+      left_hr.maxima[dim] = pivot
+      right_hr = self.clone
+      right_hr.minima[dim] = pivot
+      [left_hr, right_hr]
+    end
+
+    def intersects?(target, radius, metric)
+      near_point = KDTree::Point.new
+      target.length.times do |i|
+        if target[i] <= @minima[i]
+          coord = @minima[i]
+        elsif @minima[i] < target[i] && target[i] < @maxima[i]
+          coord = target[i]
+        else
+          coord = @maxima[i]
+        end
+        near_point[i] = coord
+      end
+      near_point.distance_from(target, metric) <= radius
+    end
+  end
+end

data/lib/kd_tree/point.rb

@@ -0,0 +1,30 @@
+class KDTree
+  class Point < Array
+    attr_accessor :data
+
+    def distance_from(target, metric)
+      i = 0
+      case metric
+        when :euclidean
+          self.inject(0) do |acc, el|
+            dist = acc + ((el-target[i])**2.0)
+            i += 1
+            dist
+          end
+        when :manhattan
+          self.inject(0) do |acc, el|
+            dist = acc + (el-target[i]).abs
+            i += 1
+            dist
+          end
+        when :chebyshev
+          self.inject(0) do |acc, el|
+            delt = (el-target[i]).abs
+            dist = delt > acc ? delt : acc
+            i += 1
+            dist
+          end
+      end
+    end
+  end
+end

data/spec/kd_tree_spec.rb

@@ -0,0 +1,8 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe KDTree do
+  it "should exist" do
+    Module.constants.should include :KDTree
+    KDTree.should be_a Module
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,12 @@
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'rspec'
+require 'kd-tree'
+
+# Requires supporting files with custom matchers and macros, etc,
+# in ./support/ and its subdirectories.
+Dir["#{File.dirname(__FILE__)}/support/**/*.rb"].each {|f| require f}
+
+RSpec.configure do |config|
+
+end

metadata

@@ -0,0 +1,110 @@
+--- !ruby/object:Gem::Specification
+name: kd-tree
+version: !ruby/object:Gem::Version
+  version: 0.0.3
+  prerelease: 
+platform: ruby
+authors:
+- Jeremy Holland
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2011-10-04 00:00:00.000000000Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: &2169163600 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 2.3.0
+  type: :development
+  prerelease: false
+  version_requirements: *2169163600
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: &2169163000 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 1.0.0
+  type: :development
+  prerelease: false
+  version_requirements: *2169163000
+- !ruby/object:Gem::Dependency
+  name: jeweler
+  requirement: &2169162400 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 1.6.4
+  type: :development
+  prerelease: false
+  version_requirements: *2169162400
+- !ruby/object:Gem::Dependency
+  name: rcov
+  requirement: &2169161820 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *2169161820
+description: Great for nearest neighbor search in k dimensions! (as long as k is reasonable)
+email: jeremy@jeremypholland.com
+executables: []
+extensions: []
+extra_rdoc_files:
+- LICENSE.txt
+- README.rdoc
+files:
+- .document
+- .rspec
+- .rvmrc
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.rdoc
+- Rakefile
+- VERSION
+- kd-tree.gemspec
+- lib/kd-tree.rb
+- lib/kd_tree.rb
+- lib/kd_tree/hyper_rect.rb
+- lib/kd_tree/point.rb
+- spec/kd_tree_spec.rb
+- spec/spec_helper.rb
+homepage: http://github.com/awebneck/kdtree
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: 3577641377396895372
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.10
+signing_key: 
+specification_version: 3
+summary: A pure-ruby kd-tree implementation
+test_files: []