bresenham 0.0.2

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in bresenham.gemspec
+gemspec

data/LICENSE

@@ -0,0 +1,22 @@
+Copyright (c) 2012 Sean McCarthy
+
+MIT License
+
+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.md

@@ -0,0 +1,27 @@
+# Bresenham
+
+A set of functions implementing Bresenham's algorithm for lines and circles.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'bresenham'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install bresenham
+
+## Usage
+
+    require 'bresenham'
+    # x_start, y_start, x_end, y_end
+    line_points_set = Bresenham::Line::coordinates(0, 0, 3, 10)
+
+    # x_origin, y_origin, radius
+    circle_points_set = Bresenham::Circle::coordinates(0, 0, 10)
+

data/Rakefile

@@ -0,0 +1,7 @@
+#!/usr/bin/env rake
+require "bundler/gem_tasks"
+require 'rake/testtask'
+
+Rake::TestTask.new do |t|
+  t.pattern = "test/*.rb"
+end

data/bresenham.gemspec

@@ -0,0 +1,17 @@
+# -*- encoding: utf-8 -*-
+require File.expand_path('../lib/bresenham/version', __FILE__)
+
+Gem::Specification.new do |gem|
+  gem.authors       = ["Sean McCarthy"]
+  gem.email         = ["sean@clanmccarthy.net"]
+  gem.description   = %q{Implementation of Bresenham's algorithm for lines and circles. Functions return sets of coordinates that can be used for plotting.}
+  gem.summary       = %q{Implementation of Bresenham's algorithm for lines and circles.}
+  gem.homepage      = "https://github.com/seandmccarthy/bresenham"
+
+  gem.files         = `git ls-files`.split($\)
+  gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.name          = "bresenham"
+  gem.require_paths = ["lib"]
+  gem.version       = Bresenham::VERSION
+end

data/lib/ascii_plot.rb

@@ -0,0 +1,34 @@
+class ASCIIPlot
+
+  DOT = '.'
+  EMPTY = ' '
+  X_AXIS = '-'
+  Y_AXIS = '|'
+
+  def initialize(x_start, x_end, y_start, y_end)
+    @x_start = x_start
+    @x_end = x_end
+    @y_start = y_start
+    @y_end = y_end
+  end
+
+  def plot(point_list)
+    output = ''
+    @y_end.downto(@y_start).each do |y|
+      (@x_start..@x_end).each do |x|
+        if point_list.include?([x,y])
+          output << DOT
+        elsif x == 0
+          output << Y_AXIS
+        elsif y == 0
+          output << X_AXIS
+        else
+          output << EMPTY
+        end
+      end
+      output << "\n"
+    end
+    output
+  end
+
+end

data/lib/bresenham.rb

@@ -0,0 +1,8 @@
+require "bresenham/version"
+require "bresenham/circle"
+require "bresenham/line"
+require 'set'
+
+module Bresenham
+
+end

data/lib/bresenham/circle.rb

@@ -0,0 +1,89 @@
+module Bresenham
+  module Circle
+    def self.coordinates(xm, ym, radius)
+      x = -radius
+      y = 0
+      err = 2-2*radius
+      coords = Set.new
+
+      begin
+        coords << [xm + x, ym - y]
+        coords << [xm - x, ym + y]
+        coords << [xm + y, ym + x]
+        coords << [xm - y, ym - x]
+        radius = err
+        if radius <= y
+          y += 1
+          err += y * 2 + 1
+        end
+        if radius > x or err > y
+          x += 1
+          err += x * 2 + 1
+        end
+      end while (x < 0)
+      coords
+    end
+
+    def self.coordinates2(x0, y0, r)
+      p = 3 - 2 * r
+      x = 0
+      y = r
+      coords = Set.new
+
+      while (y >= x)
+        coords << [x0 + x, y0 + y]
+        coords << [x0 + x, y0 - y]
+        coords << [x0 - x, y0 + y]
+        coords << [x0 - x, y0 - y]
+        coords << [x0 + y, y0 + x]
+        coords << [x0 + y, y0 - x]
+        coords << [x0 - y, y0 + x]
+        coords << [x0 - y, y0 - x]
+        if (p < 0)
+          p += 4*x + 6
+          x += 1
+        else
+          p += 4*(x - y) + 10
+          x += 1
+          y -= 1
+        end
+      end
+      coords
+    end
+
+    def self.midpoint_algorithm(x0, y0, radius)
+      f = 1 - radius
+      ddF_x = 1
+      ddF_y = -2 * radius
+      x = 0
+      y = radius
+      coords = Set.new
+    
+      coords << [x0, y0 + radius]
+      coords << [x0, y0 - radius]
+      coords << [x0 + radius, y0]
+      coords << [x0 - radius, y0]
+    
+      while x < y
+        if f >= 0
+          y -= 1
+          ddF_y += 2
+          f += ddF_y
+        end
+        x += 1
+        ddF_x += 2;
+        f += ddF_x;    
+        coords << [x0 + x, y0 + y]
+        coords << [x0 - x, y0 + y]
+        coords << [x0 + x, y0 - y]
+        coords << [x0 - x, y0 - y]
+        coords << [x0 + y, y0 + x]
+        coords << [x0 - y, y0 + x]
+        coords << [x0 + y, y0 - x]
+        coords << [x0 - y, y0 - x]
+      end
+      coords
+    end
+
+  end
+end

data/lib/bresenham/line.rb

@@ -0,0 +1,26 @@
+module Bresenham
+  module Line
+    def self.coordinates(x0, y0, x1, y1)
+      dx     = (x1 - x0).abs
+      dy     = -(y1 - y0).abs
+      step_x = x0 < x1 ? 1 : -1
+      step_y = y0 < y1 ? 1 : -1 
+      err    = dx + dy
+  
+      coords = Set.new [[x0, y0]]
+      begin
+        e2 = 2*err;
+        if e2 >= dy
+          err += dy
+          x0 += step_x
+        end
+        if e2 <= dx
+          err += dx
+          y0 += step_y
+        end
+        coords << [x0, y0]
+      end until (x0 == x1 && y0 == y1)
+      coords
+    end
+  end
+end

data/lib/bresenham/version.rb

@@ -0,0 +1,3 @@
+module Bresenham
+  VERSION = "0.0.2"
+end

data/test/ascii_plot_test.rb

@@ -0,0 +1,174 @@
+require 'minitest/autorun'
+require 'bresenham'
+require 'ascii_plot'
+
+class TestASCIIPlot < MiniTest::Unit::TestCase
+
+  def test_short_line_plot
+    expected = <<EOP
+|          
+|          
+|          
+|          
+|          
+|          
+|          
+|        ..
+|    ....  
+| ...      
+..---------
+EOP
+    plot = ASCIIPlot.new(0, 10, 0, 10)
+    output = plot.plot Bresenham::Line::coordinates(0, 0, 10, 3)
+    assert_equal output, expected
+  end
+
+  def test_long_line_plot
+    expected = <<EOP
+          |         .
+          |        . 
+          |        . 
+          |       .  
+          |      .   
+          |     .    
+          |     .    
+          |    .     
+          |   .      
+          |  .       
+----------|--.-------
+          | .        
+          |.         
+          .          
+          .          
+         .|          
+        . |          
+       .  |          
+       .  |          
+      .   |          
+     .    |          
+EOP
+    plot = ASCIIPlot.new(-10, 10, -10, 10)
+    output = plot.plot Bresenham::Line::coordinates(-5, -10, 10, 10)
+    assert_equal output, expected
+  end
+
+  def test_small_circle_plot
+    expected = <<EOP
+   ...   
+  . | .  
+ .  |  . 
+.   |   .
+.---|---.
+.   |   .
+ .  |  . 
+  . | .  
+   ...   
+EOP
+    plot = ASCIIPlot.new(-4, 4, -4, 4)
+    output = plot.plot Bresenham::Circle::coordinates(0, 0, 4)
+    assert_equal output, expected
+  end
+
+  def test_mid_circle_plot
+    expected = <<EOP
+      .....      
+    ..  |  ..    
+   .    |    .   
+  .     |     .  
+ .      |      . 
+ .      |      . 
+.       |       .
+.       |       .
+.-------|-------.
+.       |       .
+.       |       .
+ .      |      . 
+ .      |      . 
+  .     |     .  
+   .    |    .   
+    ..  |  ..    
+      .....      
+EOP
+    plot = ASCIIPlot.new(-8, 8, -8, 8)
+    output = plot.plot Bresenham::Circle::coordinates(0, 0, 8)
+    assert_equal output, expected
+  end
+
+  def test_large_circle_plot
+    expected = <<EOP
+                .........                
+             ...    |    ...             
+           ..       |       ..           
+         ..         |         ..         
+        .           |           .        
+       .            |            .       
+      .             |             .      
+     .              |              .     
+    .               |               .    
+   .                |                .   
+   .                |                .   
+  .                 |                 .  
+  .                 |                 .  
+ .                  |                  . 
+ .                  |                  . 
+ .                  |                  . 
+.                   |                   .
+.                   |                   .
+.                   |                   .
+.                   |                   .
+.-------------------|-------------------.
+.                   |                   .
+.                   |                   .
+.                   |                   .
+.                   |                   .
+ .                  |                  . 
+ .                  |                  . 
+ .                  |                  . 
+  .                 |                 .  
+  .                 |                 .  
+   .                |                .   
+   .                |                .   
+    .               |               .    
+     .              |              .     
+      .             |             .      
+       .            |            .       
+        .           |           .        
+         ..         |         ..         
+           ..       |       ..           
+             ...    |    ...             
+                .........                
+EOP
+    plot = ASCIIPlot.new(-20, 20, -20, 20)
+    output = plot.plot Bresenham::Circle::coordinates(0, 0, 20)
+    assert_equal output, expected
+  end
+
+  def test_non_zero_origin_plot
+    expected = <<EOP
+      .   |          
+      .   |          
+     .    |          
+     .    |          
+     .    |          
+     .    |          
+     .    |          
+     .    |          
+     .    |          
+      .   |          
+------.---|----------
+       .  |          
+        . |          
+         .|          
+          ..       ..
+          | .......  
+          |          
+          |          
+          |          
+          |          
+          |          
+EOP
+    plot = ASCIIPlot.new(-10, 10, -10, 10)
+    output = plot.plot Bresenham::Circle::coordinates(5, 5, 10)
+    assert_equal output, expected
+  end
+end

data/test/circle_test.rb

@@ -0,0 +1,26 @@
+require 'minitest/autorun'
+require 'bresenham'
+
+class TestBresenham < MiniTest::Unit::TestCase
+
+  def test_unit_circle
+    expected = [[-1, 0], [0, -1], [0, 1], [1, 0]]
+    assert_equal Bresenham::Circle::coordinates(0, 0, 1).to_a.sort, expected
+  end
+
+  def test_odd_radius
+    expected = [[-3, -1], [-3, 0], [-3, 1], [-2, -2], [-2, 2], [-1, -3], [-1, 3], [0, -3], [0, 3], [1, -3], [1, 3], [2, -2], [2, 2], [3, -1], [3, 0], [3, 1]]
+    assert_equal Bresenham::Circle::coordinates(0, 0, 3).to_a.sort, expected
+  end
+
+  def test_even_radius
+    expected = [[-4, -1], [-4, 0], [-4, 1], [-3, -2], [-3, 2], [-2, -3], [-2, 3], [-1, -4], [-1, 4], [0, -4], [0, 4], [1, -4], [1, 4], [2, -3], [2, 3], [3, -2], [3, 2], [4, -1], [4, 0], [4, 1]]
+    assert_equal Bresenham::Circle::coordinates(0, 0, 4).to_a.sort, expected
+  end
+
+  def test_non_zero_origin
+    expected = [[-6, -3], [-6, -2], [-6, -1], [-5, -4], [-5, 0], [-4, -5], [-4, 1], [-3, -6], [-3, 2], [-2, -6], [-2, 2], [-1, -6], [-1, 2], [0, -5], [0, 1], [1, -4], [1, 0], [2, -3], [2, -2], [2, -1]]
+    assert_equal Bresenham::Circle::coordinates(-2, -2, 4).to_a.sort, expected
+  end
+
+end

data/test/line_test.rb

@@ -0,0 +1,31 @@
+require 'minitest/autorun'
+require 'bresenham'
+
+class TestBresenhamLine < MiniTest::Unit::TestCase
+
+  def test_horizontal
+    expected = [[0, 0], [1, 0], [2, 0]]
+    assert_equal Bresenham::Line::coordinates(0, 0, 2, 0).to_a, expected
+  end
+
+  def test_diagonal
+    expected = [[0, 0], [1, 1], [2, 2], [3, 3], [4, 4], [5, 5]]
+    assert_equal Bresenham::Line::coordinates(0, 0, 5, 5).to_a, expected
+  end
+
+  def test_30_degrees
+    expected = [[0, 0], [1, 0], [2, 1], [3, 1], [4, 1], [5, 2], [6, 2], [7, 2], [8, 2], [9, 3], [10, 3]]
+    assert_equal Bresenham::Line::coordinates(0, 0, 10, 3).to_a, expected
+  end
+
+  def test_30_degress_backwards
+    expected = [[10, 3], [9, 3], [8, 2], [7, 2], [6, 2], [5, 1], [4, 1], [3, 1], [2, 1], [1, 0], [0, 0]]
+    assert_equal Bresenham::Line::coordinates(10, 3, 0, 0).to_a, expected
+  end
+
+  def test_negative_axis
+    expected = [[1, 3], [1, 2], [0, 1], [0, 0], [0, -1], [-1, -2], [-1, -3]]
+    assert_equal Bresenham::Line::coordinates(1, 3, -1, -3).to_a, expected
+  end
+
+end

metadata

@@ -0,0 +1,63 @@
+--- !ruby/object:Gem::Specification
+name: bresenham
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+  prerelease: 
+platform: ruby
+authors:
+- Sean McCarthy
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-08-14 00:00:00.000000000 Z
+dependencies: []
+description: Implementation of Bresenham's algorithm for lines and circles. Functions
+  return sets of coordinates that can be used for plotting.
+email:
+- sean@clanmccarthy.net
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- bresenham.gemspec
+- lib/ascii_plot.rb
+- lib/bresenham.rb
+- lib/bresenham/circle.rb
+- lib/bresenham/line.rb
+- lib/bresenham/version.rb
+- test/ascii_plot_test.rb
+- test/circle_test.rb
+- test/line_test.rb
+homepage: https://github.com/seandmccarthy/bresenham
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.15
+signing_key: 
+specification_version: 3
+summary: Implementation of Bresenham's algorithm for lines and circles.
+test_files:
+- test/ascii_plot_test.rb
+- test/circle_test.rb
+- test/line_test.rb