bribera-rubyvor 0.0.2

data/lib/ruby_vor/decomposition.rb

@@ -0,0 +1,22 @@
+module RubyVor
+  module VDDT
+    class Decomposition
+      attr_reader :voronoi_diagram_raw, :delaunay_triangulation_raw
+      def initialize(vd_raw=[], dt_raw=[])
+        @voronoi_diagram_raw = vd_raw
+        @delaunay_triangulation_raw   = dt_raw
+      end
+      
+      private
+
+      def voronoi_diagram_raw=(v)
+        @voronoi_diagram_raw = v
+      end
+
+      def delaunay_triangulation_raw=(v)
+        @delaunay_triangulation_raw = v
+      end
+      
+    end
+  end
+end

data/lib/ruby_vor/point.rb

@@ -0,0 +1,19 @@
+module RubyVor
+  class Point
+    attr_accessor :x, :y
+    def initialize(x=0.0,y=0.0)
+      @x = x
+      @y = y
+    end
+
+    class << self
+      def test_large
+        a = []
+        1000000.times {
+          a << new(100000.0 * rand, 100000.0 * rand)
+        }
+        a
+      end
+    end
+  end
+end

data/lib/ruby_vor/version.rb

@@ -0,0 +1,3 @@
+module RubyVor
+  VERSION = '0.0.2'
+end

data/lib/ruby_vor.rb

@@ -0,0 +1,13 @@
+$:.unshift File.dirname(__FILE__)
+$:.unshift File.join(File.dirname(__FILE__), '..', 'ext')
+require 'voronoi_interface.so'
+require 'ruby_vor/version'
+require 'ruby_vor/point'
+require 'ruby_vor/decomposition'
+
+module RubyVor
+  def self.test_l
+    VDDT::Decomposition.from_points(Point.test_large)
+  end
+  
+end

data/rubyvor.gemspec

@@ -0,0 +1,34 @@
+Gem::Specification.new do |s|
+  s.name = %q{rubyvor}
+  s.version = "0.0.2"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Brendan Ribera"]
+  s.date = %q{2008-12-03}
+  s.description = %q{RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points. It is intended to function as a complemenet to GeoRuby. These structures can be used to compute a nearest-neighbor graph for a set of points. This graph can in turn be used for proximity-based clustering of the input points.}
+  s.email = ["brendan.ribera+rubyvor@gmail.com"]
+  s.extensions = ["ext/extconf.rb"]
+  s.extra_rdoc_files = ["History.txt", "Manifest.txt", "README.txt"]
+  s.files = ["History.txt", "Manifest.txt", "README.txt", "Rakefile", "ext/Doc", "ext/edgelist.c", "ext/extconf.rb", "ext/geometry.c", "ext/heap.c", "ext/memory.c", "ext/output.c", "ext/vdefs.h", "ext/voronoi.c", "ext/voronoi_interface.c", "lib/ruby_vor.rb", "lib/ruby_vor/decomposition.rb", "lib/ruby_vor/point.rb", "lib/ruby_vor/version.rb", "rubyvor.gemspec", "test/test_voronoi_interface.rb"]
+  s.has_rdoc = true
+  s.homepage = %q{http://github.com/bribera/rubyvor}
+  s.rdoc_options = ["--main", "README.txt"]
+  s.require_paths = ["lib", "ext"]
+  s.rubyforge_project = %q{rubyvor}
+  s.rubygems_version = %q{1.2.0}
+  s.summary = %q{RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points}
+  s.test_files = ["test/test_voronoi_interface.rb"]
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 2
+
+    if current_version >= 3 then
+      s.add_development_dependency(%q<hoe>, [">= 1.8.2"])
+    else
+      s.add_dependency(%q<hoe>, [">= 1.8.2"])
+    end
+  else
+    s.add_dependency(%q<hoe>, [">= 1.8.2"])
+  end
+end

data/test/test_voronoi_interface.rb

@@ -0,0 +1,158 @@
+require 'rubygems'
+require 'minitest/unit'
+require File.dirname(__FILE__) + '/../lib/ruby_vor'
+
+class TestVoronoiInterface < MiniTest::Unit::TestCase
+
+  MAX_DELTA = 0.000001
+  
+  def initialize(*args)
+    @points = @trianglulation_raw = @diagram_raw = nil
+    super(*args)
+  end
+  
+  def test_diagram_correct
+    # Perform the decomposition.
+    decomp = RubyVor::VDDT::Decomposition.from_points(sample_points)
+
+    # Test each raw entry against three basic assertions:
+    #  * entry lengths must match
+    #  * entry types must match
+    #  * entry values must match, with allowance for rounding errors (i.e. within a very small delta)
+    decomp.voronoi_diagram_raw.each_with_index do |computed_entry, i|
+      sample_entry = example_diagram_raw[i]
+
+      
+      assert_equal computed_entry.length, sample_entry.length
+      assert_equal computed_entry.first,  sample_entry.first
+      
+      computed_entry.each_with_index do |computed_value,j|    
+        # We already tested the type...
+        next if j == 0
+        assert_in_delta computed_value, sample_entry[j], MAX_DELTA
+      end
+    end
+  end
+  
+
+  def test_triangulation_correct
+    # Perform the decomposition.
+    decomp = RubyVor::VDDT::Decomposition.from_points(sample_points)
+
+    # One assertion:
+    #  * raw triangulation must match exactly.
+    
+    assert_equal example_triangulation_raw, decomp.delaunay_triangulation_raw
+  end
+  
+
+  
+  #
+  # A few helper methods
+  #
+  
+  private
+  
+  def sample_points
+    # Build a sample case
+    if @points.nil? || @points.empty?
+      @points = []
+      data = %w{ 0.0 0.0
+                 0.0 0.5
+                 0.5 0.0
+                 3   3
+                 0.5 0.5
+                 5.0 5.0
+                 5.0 5.5
+                 5.5 5.0
+                 5.5 5.5 }
+      for x in 0..(data.length/2 - 1)
+        @points << RubyVor::Point.new(data[x * 2].to_f, data[x * 2 + 1].to_f)
+      end
+    end
+    @points
+  end
+
+  def example_diagram_raw
+    if @diagram_raw.nil? || @diagram_raw.empty?
+      @diagram_raw = [
+                      [:s, 0.000000, 0.000000],
+                      [:s, 0.500000, 0.000000],
+                      [:l, 1.000000, 0.000000, 0.250000],
+                      [:s, 0.000000, 0.500000],
+                      [:l, 0.000000, 1.000000, 0.250000],
+                      [:s, 0.500000, 0.500000],
+                      [:l, 0.000000, 1.000000, 0.250000],
+                      [:v, 0.250000, 0.250000],
+                      [:l, 1.000000, 1.000000, 0.500000],
+                      [:v, 0.250000, 0.250000],
+                      [:e, 3, 1, 0],
+                      [:l, 1.000000, 0.000000, 0.250000],
+                      [:s, 3.000000, 3.000000],
+                      [:l, 1.000000, 1.000000, 3.500000],
+                      [:v, 3.250000, 0.250000],
+                      [:e, 2, 0, 2],
+                      [:l, 0.833333, 1.000000, 2.958333],
+                      [:s, 5.000000, 5.000000],
+                      [:l, 1.000000, 1.000000, 8.000000],
+                      [:s, 5.500000, 5.000000],
+                      [:l, 1.000000, 0.800000, 7.450000],
+                      [:v, 5.249999, 2.750001],
+                      [:l, 1.000000, 0.000000, 5.250000],
+                      [:s, 5.000000, 5.500000],
+                      [:l, 0.000000, 1.000000, 5.250000],
+                      [:s, 5.500000, 5.500000],
+                      [:l, 0.000000, 1.000000, 5.250000],
+                      [:v, 5.250000, 5.250000],
+                      [:e, 9, 4, 3],
+                      [:l, 1.000000, 1.000000, 10.500000],
+                      [:v, 5.250000, 5.250000],
+                      [:e, 12, 5, 4],
+                      [:l, 1.000000, 0.000000, 5.250000],
+                      [:v, 0.250000, 3.250000],
+                      [:e, 4, 6, 1],
+                      [:e, 5, 6, 2],
+                      [:l, 1.000000, 0.833333, 2.958333],
+                      [:v, 2.750000, 5.250000],
+                      [:e, 7, 7, 3],
+                      [:e, 10, 7, 5],
+                      [:l, 0.800000, 1.000000, 7.450000],
+                      [:v, 15.249999, -9.749999],
+                      [:e, 8, 3, 8],
+                      [:e, 6, 2, 8],
+                      [:l, 1.000000, 1.000000, 5.500000],
+                      [:v, -9.749999, 15.249999],
+                      [:e, 14, 9, 6],
+                      [:e, 15, 9, 7],
+                      [:l, 1.000000, 1.000000, 5.500000],
+                      [:e, 1, -1, 1],
+                      [:e, 17, -1, 9],
+                      [:e, 13, -1, 5],
+                      [:e, 11, 4, -1],
+                      [:e, 16, 8, -1],
+                      [:e, 0, 0, -1]
+                     ]
+    end
+    @diagram_raw
+  end
+
+  def example_triangulation_raw
+    if @trianglulation_raw.nil? || @trianglulation_raw.empty?
+      @trianglulation_raw =     [
+                                 [0, 4, 2],
+                                 [1, 4, 0],
+                                 [3, 2, 4],
+                                 [5, 7, 3],
+                                 [5, 8, 7],
+                                 [6, 8, 5],
+                                 [1, 3, 4],
+                                 [3, 6, 5],
+                                 [7, 2, 3],
+                                 [1, 6, 3]
+                                ]
+    end
+    @trianglulation_raw
+  end
+end
+
+MiniTest::Unit.autorun

metadata

@@ -0,0 +1,85 @@
+--- !ruby/object:Gem::Specification 
+name: bribera-rubyvor
+version: !ruby/object:Gem::Version 
+  version: 0.0.2
+platform: ruby
+authors: 
+- Brendan Ribera
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2008-12-03 00:00:00 -08:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.8.2
+    version: 
+description: RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points. It is intended to function as a complemenet to GeoRuby. These structures can be used to compute a nearest-neighbor graph for a set of points. This graph can in turn be used for proximity-based clustering of the input points.
+email: 
+- brendan.ribera+rubyvor@gmail.com
+executables: []
+
+extensions: 
+- ext/extconf.rb
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- README.txt
+files: 
+- History.txt
+- Manifest.txt
+- README.txt
+- Rakefile
+- ext/Doc
+- ext/edgelist.c
+- ext/extconf.rb
+- ext/geometry.c
+- ext/heap.c
+- ext/memory.c
+- ext/output.c
+- ext/vdefs.h
+- ext/voronoi.c
+- ext/voronoi_interface.c
+- lib/ruby_vor.rb
+- lib/ruby_vor/decomposition.rb
+- lib/ruby_vor/point.rb
+- lib/ruby_vor/version.rb
+- rubyvor.gemspec
+- test/test_voronoi_interface.rb
+has_rdoc: true
+homepage: http://github.com/bribera/rubyvor
+post_install_message: 
+rdoc_options: 
+- --main
+- README.txt
+require_paths: 
+- lib
+- ext
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: rubyvor
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: RubyVor provides efficient computation of Voronoi diagrams and Delaunay triangulation for a set of Ruby points
+test_files: 
+- test/test_voronoi_interface.rb