geometry 6.3 → 6.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 8d541e7a304b060e2bc7bd392a4530fbfca3040b
-  data.tar.gz: 9f4bfc263c8c735ed3d28a6f32f676e0fe3606c4
+  metadata.gz: 2071223ccd3ab40dc84675595b6b204aa0d7df10
+  data.tar.gz: ed6b83fe034a5734ca9938c7ab54f4a4fcdda736
 SHA512:
-  metadata.gz: e9e952e9d9c66085aa7fc2852605467b8456ab30ac05d6106f5593b183d6ff865ec812d47d63f32f01b280838b51d93ec58811542b1adfc5b6632b9c57cfc7fc
-  data.tar.gz: 53f91b55768b360e9f07026228b150d7f250dc866098eba904b01ad0ee4d2cf9eb693399ec95a44b1a5ab6640ec8898ce68690e9971e5500456ad06db6a84b7d
+  metadata.gz: d78e31275dd418edf77a9067157213b63690bb7139ccf8c8561b228bb51e7be9e8b72e3a9187f02beb8d77ddc95427f882454f49c4827196f832acadec131e3c
+  data.tar.gz: ba61dfc2b8d83090d59fe4d5348d3b184edeca188bf59c604d6888644a7392b943f8979ac4ea82392b1d8a026b53873128bab58c64702af149c3be68c1852057

data/.travis.yml

@@ -1,4 +1,12 @@
 language: ruby
 rvm:
-  - 2.0.0
-  - 2.1.1
+- 2.0.0
+- 2.1.1
+deploy:
+  provider: rubygems
+  api_key:
+    secure: aCCrqOZ4pR5ACbPHfsurZbY2KOT3Qs5DZ7cJEG6Haa3sJXoMQ2srCtE2hsH1VO8idmrkHvl3wCEO9zNLOdx2x40xlaLVQ+wixtFKW1u9nnxjw4zszyyaxDIc8qnFsRNh6j997wyT2Sqx1YuQ8I82DnTh2I28mnxS51O33KeB0is=
+  gem: geometry
+  on:
+    tags: true
+    repo: bfoz/geometry

data/README.markdown

@@ -26,6 +26,7 @@ Primitives
 - Edge
 - [Annulus](http://en.wikipedia.org/wiki/Annulus_(mathematics))
 - [Arc](http://en.wikipedia.org/wiki/Arc_(geometry)), Circle
+- [Bézier Curves](http://en.wikipedia.org/wiki/Bézier_curve)
 - Rectangle, Square
 - Path, [Polyline](http://en.wikipedia.org/wiki/Polyline), [Polygon](http://en.wikipedia.org/wiki/Polygon), [RegularPolygon](http://en.wikipedia.org/wiki/Regular_polygon)
 - Transformation

data/geometry.gemspec

@@ -3,7 +3,7 @@ $:.push File.expand_path("../lib", __FILE__)
 
 Gem::Specification.new do |s|
   s.name        = "geometry"
-  s.version     = '6.3'
+  s.version     = '6.4'
   s.authors     = ["Brandon Fosdick"]
   s.email       = ["bfoz@bfoz.net"]
   s.homepage    = "http://github.com/bfoz/geometry"
@@ -17,7 +17,5 @@ Gem::Specification.new do |s|
   s.executables   = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
   s.require_paths = ["lib"]
 
-  # specify any dependencies here; for example:
-  # s.add_development_dependency "rspec"
-  # s.add_runtime_dependency "rest-client"
+  s.required_ruby_version = '>= 2.0'
 end

data/lib/geometry/bezier.rb

@@ -0,0 +1,48 @@
+module Geometry
+=begin
+Bézier curves are like lines, but curvier.
+
+http://en.wikipedia.org/wiki/Bézier_curve
+
+== Constructors
+
+    Bezier.new [0,0], [1,1], [2,2]  # From control points
+
+== Usage
+
+To get a point on the curve for a particular value of t, you can use the subscript operator
+
+    bezier[0.5]	# => [1,1]
+=end
+    class Bezier
+	# @!attribute degree
+	#   @return [Number]  The degree of the curve
+	def degree
+	    points.length - 1
+	end
+
+	# @!attribute points
+	#   @return [Array<Point>]  The control points for the Bézier curve
+	attr_reader :points
+
+	def initialize(*points)
+	    @points = points.map {|v| Point[v]}
+	end
+
+	# http://en.wikipedia.org/wiki/Binomial_coefficient
+	# http://rosettacode.org/wiki/Evaluate_binomial_coefficients#Ruby
+	def binomial_coefficient(k)
+	    (0...k).inject(1) {|m,i| (m * (degree - i)) / (i + 1) }
+	end
+
+	# @param t [Float]  the input parameter
+	def [](t)
+	    return nil unless (0..1).include?(t)
+	    result = Point.zero(points.first.size)
+	    points.each_with_index do |v, i|
+		result += v * binomial_coefficient(i) * ((1 - t) ** (degree - i)) * (t ** i)
+	    end
+	    result
+	end
+    end
+end

data/lib/geometry/edge.rb

@@ -8,8 +8,8 @@ module Geometry
 An edge. It's a line segment between 2 points. Generally part of a {Polygon}.
 
 == Usage
+    edge = Geometry::Edge.new([1,1], [2,2])
     edge = Geometry::Edge([1,1], [2,2])
-
 =end
 
     class Edge
@@ -44,7 +44,7 @@ An edge. It's a line segment between 2 points. Generally part of a {Polygon}.
 
 	# Return a new {Edge} with swapped endpoints
 	def reverse
-	    Edge.new(@last, @first)
+	    self.class.new(@last, @first)
 	end
 
 	# In-place swap the endpoints
@@ -53,6 +53,11 @@ An edge. It's a line segment between 2 points. Generally part of a {Polygon}.
 	    self
 	end
 
+	# @return [Number]  the length of the {Edge}
+	def length
+	    @length ||= vector.magnitude
+	end
+
 	# Return the {Edge}'s length along the Y axis
 	def height
 	    (@first.y - @last.y).abs
@@ -140,4 +145,12 @@ An edge. It's a line segment between 2 points. Generally part of a {Polygon}.
 	    [@first, @last]
 	end
     end
+
+    # Convenience initializer for {Edge} that tries to coerce its arguments into
+    #  something useful
+    # @param first	[Point, Array]	the starting point of the {Edge}
+    # @param last	[Point, Array]	the endpoint of the {Edge}
+    def Edge(first, last)
+	Edge.new(first, last)
+    end
 end

data/lib/geometry/line.rb

@@ -87,13 +87,42 @@ Supports two-point, slope-intercept, and point-slope initializer forms
 
     # @private
     class PointSlopeLine < Line
+	# @!attribute point
+	#   @return [Point]  the stating point
+	attr_reader :point
+
 	# @return [Number]  the slope of the {Line}
 	attr_reader :slope
 
+	# @param point	[Point]	    a {Point} that lies on the {Line}
+	# @param slope	[Number]    the slope of the {Line}
 	def initialize(point, slope)
 	    @point = Point[point]
 	    @slope = slope
 	end
+
+	# Two {PointSlopeLine}s are equal if both have equal slope and origin
+	def ==(other)
+	    case other
+		when SlopeInterceptLine
+		    # Check that the slopes are equal and that the starting point will solve the slope-intercept equation
+		    (slope == other.slope) && (point.y == other.slope * point.x + other.intercept)
+		when TwoPointLine
+		    # Plug both of other's endpoints into the line equation and check that they solve it
+		    first_diff = other.first - point
+		    last_diff = other.last - point
+		    (first_diff.y == slope*first_diff.x) && (last_diff.y == slope*last_diff.x)
+		else
+		    self.eql? other
+	    end
+	end
+
+	# Two {PointSlopeLine}s are equal if both have equal slopes and origins
+	#   @note eql? does not check for equivalence between cluster subclases
+	def eql?(other)
+	    (point == other.point) && (slope == other.slope)
+	end
+
 	def to_s
 	    'Line(' + @slope.to_s + ',' + @point.to_s + ')'
 	end
@@ -104,11 +133,33 @@ Supports two-point, slope-intercept, and point-slope initializer forms
 	# @return [Number]  the slope of the {Line}
 	attr_reader :slope
 
+	# @param slope	    [Number]    the slope
+	# @param intercept  [Number]	the location of the y-axis intercept
 	def initialize(slope, intercept)
 	    @slope = slope
 	    @intercept = intercept
 	end
 
+	# Two {SlopeInterceptLine}s are equal if both have equal slope and intercept
+	def ==(other)
+	    case other
+		when PointSlopeLine
+		    # Check that the slopes are equal and that the starting point will solve the slope-intercept equation
+		    (slope == other.slope) && (other.point.y == slope * other.point.x + intercept)
+		when TwoPointLine
+		    # Check that both endpoints solve the line equation
+		    ((other.first.y == slope * other.first.x + intercept)) && (other.last.y == (slope * other.last.x + intercept))
+		else
+		    self.eql? other
+		end
+	end
+
+	# Two {SlopeInterceptLine}s are equal if both have equal slopes and intercepts
+	#   @note eql? does not check for equivalence between cluster subclases
+	def eql?(other)
+	    (intercept == other.intercept) && (slope == other.slope)
+	end
+
 	def horizontal?
 	    0 == @slope
 	end
@@ -142,6 +193,28 @@ Supports two-point, slope-intercept, and point-slope initializer forms
 	end
 	alias :to_s :inspect
 
+	# Two {TwoPointLine}s are equal if both have equal {Point}s in the same order
+	def ==(other)
+	    case other
+		when PointSlopeLine
+		    # Plug both endpoints into the line equation and check that they solve it
+		    first_diff = first - other.point
+		    last_diff = last - other.point
+		    (first_diff.y == other.slope*first_diff.x) && (last_diff.y == other.slope*last_diff.x)
+		when SlopeInterceptLine
+		    # Check that both endpoints solve the line equation
+		    ((first.y == other.slope * first.x + other.intercept)) && (last.y == (other.slope * last.x + other.intercept))
+		else
+		    self.eql?(other) || ((first == other.last) && (last == other.first))
+		end
+	end
+
+	# Two {TwoPointLine}s are equal if both have equal endpoints
+	#   @note eql? does not check for equivalence between cluster subclases
+	def eql?(other)
+	    (first == other.first) && (last == other.last)
+	end
+
 # @group Accessors
 	# !@attribute [r[ slope
 	#   @return [Number]	the slope of the {Line}

data/lib/geometry/point.rb

@@ -119,6 +119,44 @@ geometry class (x, y, z).
 	    'Point' + @elements.to_s
 	end
 
+	# @override max()
+	# @return [Number]  The maximum value of the {Point}'s elements
+	# @override max(point)
+	# @return [Point]    The element-wise maximum values of the receiver and the given {Point}
+	def max(*args)
+	    if args.empty?
+		@elements.max
+	    else
+		args = args.first if 1 == args.size
+		self.class[@elements.zip(args).map(&:max)]
+	    end
+	end
+
+	# @override min()
+	# @return [Number]  The minimum value of the {Point}'s elements
+	# @override min(point)
+	# @return [Point]    The element-wise minimum values of the receiver and the given {Point}
+	def min(*args)
+	    if args.empty?
+		@elements.min
+	    else
+		args = args.first if 1 == args.size
+		self.class[@elements.zip(args).map(&:min)]
+	    end
+	end
+
+	# @override minmax()
+	# @return [Array<Number>]   The minimum value of the {Point}'s elements
+	# @override min(point)
+	# @return [Array<Point>]    The element-wise minimum values of the receiver and the given {Point}
+	def minmax(*args)
+	    if args.empty?
+		@elements.minmax
+	    else
+		[min(*args), max(*args)]
+	    end
+	end
+
 # @group Accessors
 	# @param [Integer]  i	Index into the {Point}'s elements
 	# @return [Numeric] Element i (starting at 0)

data/lib/geometry/point_iso.rb

@@ -53,6 +53,44 @@ An object repesenting a N-dimensional {Point} with identical elements.
 	    []
 	end
 
+	# @override max()
+	# @return [Number]  The maximum value of the {Point}'s elements
+	# @override max(point)
+	# @return [Point]    The element-wise maximum values of the receiver and the given {Point}
+	def max(*args)
+	    if args.empty?
+		@value
+	    else
+		args = args.first if 1 == args.size
+		Point[Array.new(args.size, @value).zip(args).map(&:max)]
+	    end
+	end
+
+	# @override min()
+	# @return [Number]  The minimum value of the {Point}'s elements
+	# @override min(point)
+	# @return [Point]    The element-wise minimum values of the receiver and the given {Point}
+	def min(*args)
+	    if args.empty?
+		@value
+	    else
+		args = args.first if 1 == args.size
+		Point[Array.new(args.size, @value).zip(args).map(&:min)]
+	    end
+	end
+
+	# @override minmax()
+	# @return [Array<Number>]   The minimum value of the {Point}'s elements
+	# @override min(point)
+	# @return [Array<Point>]    The element-wise minimum values of the receiver and the given {Point}
+	def minmax(*args)
+	    if args.empty?
+		[@value, @value]
+	    else
+		[min(*args), max(*args)]
+	    end
+	end
+
 # @group Accessors
 	# @param i [Integer]	Index into the {Point}'s elements
 	# @return [Numeric] Element i (starting at 0)

data/lib/geometry/point_one.rb

@@ -67,6 +67,44 @@ everything else, regardless of size. It's similar to the
 	end
 # @endgroup
 
+    # @override max()
+    # @return [Number]  The maximum value of the {Point}'s elements
+    # @override max(point)
+    # @return [Point]    The element-wise maximum values of the receiver and the given {Point}
+    def max(*args)
+	if args.empty?
+	    1
+	else
+	    args = args.first if 1 == args.size
+	    Point[Array.new(args.size, 1).zip(args).map(&:max)]
+	end
+    end
+
+    # @override min()
+    # @return [Number]  The minimum value of the {Point}'s elements
+    # @override min(point)
+    # @return [Point]    The element-wise minimum values of the receiver and the given {Point}
+    def min(*args)
+	if args.empty?
+	    1
+	else
+	    args = args.first if 1 == args.size
+	    Point[Array.new(args.size, 1).zip(args).map(&:min)]
+	end
+    end
+
+    # @override minmax()
+    # @return [Array<Number>]   The minimum value of the {Point}'s elements
+    # @override min(point)
+    # @return [Array<Point>]    The element-wise minimum values of the receiver and the given {Point}
+    def minmax(*args)
+	if args.empty?
+	    [1, 1]
+	else
+	    [min(*args), max(*args)]
+	end
+    end
+
 # @group Arithmetic
 
 # @group Unary operators

data/lib/geometry/point_zero.rb

@@ -67,6 +67,44 @@ everything else, regardless of size. You can think of it as an application of th
 	end
 # @endgroup
 
+	# @override max()
+	# @return [Number]  The maximum value of the {Point}'s elements
+	# @override max(point)
+	# @return [Point]    The element-wise maximum values of the receiver and the given {Point}
+	def max(*args)
+	    if args.empty?
+		0
+	    else
+		args = args.first if 1 == args.size
+		Array.new(args.size, 0).zip(args).map(&:max)
+	    end
+	end
+
+	# @override min()
+	# @return [Number]  The minimum value of the {Point}'s elements
+	# @override min(point)
+	# @return [Point]    The element-wise minimum values of the receiver and the given {Point}
+	def min(*args)
+	    if args.empty?
+		0
+	    else
+		args = args.first if 1 == args.size
+		Array.new(args.size, 0).zip(args).map(&:min)
+	    end
+	end
+
+	# @override minmax()
+	# @return [Array<Number>]   The minimum value of the {Point}'s elements
+	# @override min(point)
+	# @return [Array<Point>]    The element-wise minimum values of the receiver and the given {Point}
+	def minmax(*args)
+	    if args.empty?
+		[0, 0]
+	    else
+		[min(*args), max(*args)]
+	    end
+	end
+
 # @group Arithmetic
 
 # @group Unary operators

data/lib/geometry/square.rb

@@ -20,6 +20,11 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 	#   @return [Point]  The {Square}'s origin
 	attr_reader :origin
 
+	# @!attribute points
+	#   @return [Array<Point>]  the corner {Point}s of the {Square} in counter-clockwise order
+	attr_reader :points
+	alias :vertices :points
+
 	# @overload new(:origin, :size)
 	#  Creates a {Square} with the given origin and size
 	#  @option [Point]  :origin The lower-left corner
@@ -75,6 +80,12 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 	    true
 	end
 
+	# @!attribute [r] edges
+	#   @return [Array<Edge>]  An array of {Edge}s corresponding to the sides of the {Square}
+	def edges
+	    (points + [points.first]).each_cons(2).map {|v1,v2| Edge.new v1, v2}
+	end
+
 	# @return [Point]   The upper right corner of the bounding {Rectangle}
 	def max
 	    @points.last
@@ -96,6 +107,11 @@ The {Square} class cluster is like the {Rectangle} class cluster, but not longer
 	    @points.first
 	end
 
+	def points
+	    p0, p1 = *@points
+	    [p0, Point[p1.x, p0.y], p1, Point[p0.x, p1.y]]
+	end
+
 	def height
 	    min, max = @points.minmax {|a,b| a.y <=> b.y}
 	    max.y - min.y

data/test/geometry/bezier.rb

@@ -0,0 +1,25 @@
+require 'minitest/autorun'
+require 'geometry/bezier'
+
+describe Geometry::Bezier do
+    subject { Geometry::Bezier.new [0,0], [1,1], [2,2], [3,3] }
+
+    it 'must have control points' do
+	subject.points.length.must_equal 4
+    end
+
+    it 'must generate Pascals Triangle' do
+	subject.binomial_coefficient(0).must_equal 1
+	subject.binomial_coefficient(1).must_equal 3
+	subject.binomial_coefficient(2).must_equal 3
+	subject.binomial_coefficient(3).must_equal 1
+    end
+
+    it 'must return nil when t is out of range' do
+	subject[2].must_equal nil
+    end
+
+    it 'must subscript on the parameter' do
+	subject[0.5].must_equal Point[1.5, 1.5]
+    end
+end

data/test/geometry/edge.rb

@@ -16,6 +16,12 @@ describe Geometry::Edge do
 	assert_equal(Geometry::Point[1,0], edge.last)
     end
 
+    it 'must have a convenience initializer' do
+	edge = Edge([0,0], [1,0])
+	edge.must_be_kind_of Geometry::Edge
+	edge.must_equal Edge.new([0,0], [1,0])
+    end
+
     it "must handle equality" do
 	edge1 = Edge.new([1,0], [0,1])
 	edge2 = Edge.new([1,0], [0,1])
@@ -24,6 +30,10 @@ describe Geometry::Edge do
 	edge1.wont_equal edge3
     end
 
+    it 'must have a length' do
+	Edge.new([0,0], [1,0]).length.must_equal 1
+    end
+
     it "must return the height of the edge" do
 	edge = Edge([0,0], [1,1])
 	assert_equal(1, edge.height)

data/test/geometry/line.rb

@@ -113,6 +113,27 @@ describe Geometry::PointSlopeLine do
     it "must have a slope attribute" do
 	subject.slope.must_equal 3
     end
+
+    it "must handle equality" do
+	line2 = Geometry::PointSlopeLine.new([1,2], 3)
+	line3 = Geometry::PointSlopeLine.new([1,1], 4)
+	subject.must_equal line2
+	subject.wont_equal line3
+    end
+
+    it 'must handle equality with a SlopeInterceptLine' do
+	line2 = Geometry::SlopeInterceptLine.new(3, -1)
+	line3 = Geometry::SlopeInterceptLine.new(4, -1)
+	line2.must_equal subject
+	line3.wont_equal subject
+    end
+
+    it 'must handle equality with a TwoPointLine' do
+	line2 = Geometry::TwoPointLine.new([1,2], [2,5])
+	line3 = Geometry::TwoPointLine.new([1,2], [2,4])
+	line2.must_equal subject
+	line3.wont_equal subject
+    end
 end
 
 describe Geometry::SlopeInterceptLine do
@@ -121,6 +142,27 @@ describe Geometry::SlopeInterceptLine do
     it "must have a slope attribute" do
 	subject.slope.must_equal 3
     end
+
+    it "must handle equality" do
+	line2 = Geometry::SlopeInterceptLine.new(3, 2)
+	line3 = Geometry::SlopeInterceptLine.new(4, 3)
+	subject.must_equal line2
+	subject.wont_equal line3
+    end
+
+    it 'must handle equality with a PointSlopeLine' do
+	line2 = Geometry::PointSlopeLine.new([0,2], 3)
+	line3 = Geometry::PointSlopeLine.new([0,2], 2)
+	line2.must_equal subject
+	line3.wont_equal subject
+    end
+
+    it 'must handle equality with a TwoPointLine' do
+	line2 = Geometry::TwoPointLine.new([0,2], [1,5])
+	line3 = Geometry::TwoPointLine.new([0,2], [1,4])
+	line2.must_equal subject
+	line3.wont_equal subject
+    end
 end
 
 describe Geometry::TwoPointLine do
@@ -129,4 +171,25 @@ describe Geometry::TwoPointLine do
     it "must have a slope attribute" do
 	subject.slope.must_equal 1
     end
+
+    it "must handle equality" do
+	line2 = Geometry::TwoPointLine.new([1,2], [3,4])
+	line3 = Geometry::TwoPointLine.new([1,1], [5,5])
+	subject.must_equal line2
+	subject.wont_equal line3
+    end
+
+    it 'must handle equality with a PointSlopeLine' do
+	line2 = Geometry::PointSlopeLine.new([1,2], 1)
+	line3 = Geometry::PointSlopeLine.new([1,2], 2)
+	line2.must_equal subject
+	line3.wont_equal subject
+    end
+
+    it 'must handle equality with a SlopeInterceptLine' do
+	line2 = Geometry::SlopeInterceptLine.new(1, 1)
+	line3 = Geometry::SlopeInterceptLine.new(1, -1)
+	line2.must_equal subject
+	line3.wont_equal subject
+    end
 end

data/test/geometry/point.rb

@@ -114,6 +114,58 @@ describe Geometry::Point do
 	Point[1,2].dup.must_equal Point[1,2]
     end
 
+    describe 'minmax' do
+	it 'must have a minimum' do
+	    Point[1,2].min.must_equal 1
+	end
+
+	it 'must minimum with another Point' do
+	    Point[1,3].min(Point[4,2]).must_equal Point[1,2]
+	    Point[1,3].min(Point[4,2]).must_be_kind_of Point
+	end
+
+	it 'must minimum with an Array' do
+	    Point[1,3].min([4,2]).must_equal Point[1,2]
+	end
+
+	it 'must minimum with a multiple arguments' do
+	    Point[1,3].min(4,2).must_equal Point[1,2]
+	end
+
+	it 'must have a maximum' do
+	    Point[1,2].max.must_equal 2
+	end
+
+	it 'must maximum with another Point' do
+	    Point[1,3].max(Point[4,2]).must_equal Point[4,3]
+	    Point[1,3].max(Point[4,2]).must_be_kind_of Point
+	end
+
+	it 'must maximum with an Array' do
+	    Point[1,3].max([4,2]).must_equal Point[4,3]
+	end
+
+	it 'must maximum with multiple arguments' do
+	    Point[1,3].max(4,2).must_equal Point[4,3]
+	end
+
+	it 'must have a minmax' do
+	    Point[1,2].minmax.must_equal [1,2]
+	end
+
+	it 'must minmax with another Point' do
+	    Point[1,3].minmax(Point[4,2]).must_equal [Point[1,2], Point[4,3]]
+	end
+
+	it 'must minmax with an Array' do
+	    Point[1,3].minmax([4,2]).must_equal [Point[1,2], Point[4,3]]
+	end
+
+	it 'must maximum with multiple arguments' do
+	    Point[1,3].minmax(4,2).must_equal [Point[1,2], Point[4,3]]
+	end
+    end
+
     describe "arithmetic" do
 	let(:left) { Point[1,2] }
 	let(:right) { Point[3,4] }

data/test/geometry/point_iso.rb

@@ -5,6 +5,58 @@ describe Geometry::PointIso do
     let(:value) { 5 }
     subject { Geometry::PointIso.new(5) }
 
+    describe 'minmax' do
+	it 'must have a minimum' do
+	    subject.min.must_equal 5
+	end
+
+	it 'must minimum with another Point' do
+	    subject.min(Point[4,7]).must_equal Point[4,5]
+	    subject.min(Point[4,7]).must_be_kind_of Point
+	end
+
+	it 'must minimum with an Array' do
+	    subject.min([4,7]).must_equal Point[4,5]
+	end
+
+	it 'must minimum with a multiple arguments' do
+	    subject.min(4,7).must_equal Point[4,5]
+	end
+
+	it 'must have a maximum' do
+	    subject.max.must_equal 5
+	end
+
+	it 'must maximum with another Point' do
+	    subject.max(Point[7,2]).must_equal Point[7,5]
+	    subject.max(Point[7,2]).must_be_kind_of Point
+	end
+
+	it 'must maximum with an Array' do
+	    subject.max([7,2]).must_equal Point[7,5]
+	end
+
+	it 'must maximum with multiple arguments' do
+	    subject.max(7,2).must_equal Point[7,5]
+	end
+
+	it 'must have a minmax' do
+	    subject.minmax.must_equal [5,5]
+	end
+
+	it 'must minmax with another Point' do
+	    subject.minmax(Point[7,2]).must_equal [Point[5,2], Point[7,5]]
+	end
+
+	it 'must minmax with an Array' do
+	    subject.minmax([7,2]).must_equal [Point[5,2], Point[7,5]]
+	end
+
+	it 'must maximum with multiple arguments' do
+	    subject.minmax(7,2).must_equal [Point[5,2], Point[7,5]]
+	end
+    end
+
     describe 'arithmetic' do
 	let(:left) { Point[1,2] }
 	let(:right) { Point[3,4] }

data/test/geometry/point_one.rb

@@ -5,6 +5,58 @@ describe Geometry::PointOne do
     subject { Geometry::PointOne.new }
     let(:one) { Geometry::PointOne.new }
 
+    describe 'minmax' do
+	it 'must have a minimum' do
+	    subject.min.must_equal 1
+	end
+
+	it 'must minimum with another Point' do
+	    subject.min(Point[0,7]).must_equal Point[0,1]
+	    subject.min(Point[0,7]).must_be_kind_of Point
+	end
+
+	it 'must minimum with an Array' do
+	    subject.min([0,7]).must_equal Point[0,1]
+	end
+
+	it 'must minimum with a multiple arguments' do
+	    subject.min(0,7).must_equal Point[0,1]
+	end
+
+	it 'must have a maximum' do
+	    subject.max.must_equal 1
+	end
+
+	it 'must maximum with another Point' do
+	    subject.max(Point[7,0]).must_equal Point[7,1]
+	    subject.max(Point[7,0]).must_be_kind_of Point
+	end
+
+	it 'must maximum with an Array' do
+	    subject.max([7,0]).must_equal Point[7,1]
+	end
+
+	it 'must maximum with multiple arguments' do
+	    subject.max(7,0).must_equal Point[7,1]
+	end
+
+	it 'must have a minmax' do
+	    subject.minmax.must_equal [1,1]
+	end
+
+	it 'must minmax with another Point' do
+	    subject.minmax(Point[7,0]).must_equal [Point[1,0], Point[7,1]]
+	end
+
+	it 'must minmax with an Array' do
+	    subject.minmax([7,0]).must_equal [Point[1,0], Point[7,1]]
+	end
+
+	it 'must maximum with multiple arguments' do
+	    subject.minmax(7,0).must_equal [Point[1,0], Point[7,1]]
+	end
+    end
+
     describe 'arithmetic' do
 	let(:left) { Point[1,2] }
 	let(:right) { Point[3,4] }

data/test/geometry/point_zero.rb

@@ -5,6 +5,56 @@ describe Geometry::PointZero do
     subject { Geometry::PointZero.new }
     let(:zero) { Geometry::PointZero.new }
 
+describe 'minmax' do
+    it 'must have a minimum' do
+	subject.min.must_equal 0
+    end
+
+    it 'must minimum with another Point' do
+	subject.min(Point[-1,7]).must_equal Point[-1,0]
+    end
+
+    it 'must minimum with an Array' do
+	subject.min([-1,7]).must_equal Point[-1,0]
+    end
+
+    it 'must minimum with a multiple arguments' do
+	subject.min(-1,7).must_equal Point[-1,0]
+    end
+
+    it 'must have a maximum' do
+	subject.max.must_equal 0
+    end
+
+    it 'must maximum with another Point' do
+	subject.max(Point[7,-1]).must_equal Point[7,0]
+    end
+
+    it 'must maximum with an Array' do
+	subject.max([7,-1]).must_equal Point[7,0]
+    end
+
+    it 'must maximum with multiple arguments' do
+	subject.max(7,-1).must_equal Point[7,0]
+    end
+
+    it 'must have a minmax' do
+	subject.minmax.must_equal [0, 0]
+    end
+
+    it 'must minmax with another Point' do
+	subject.minmax(Point[7,-1]).must_equal [Point[0,-1], Point[7,0]]
+    end
+
+    it 'must minmax with an Array' do
+	subject.minmax([7,-1]).must_equal [Point[0,-1], Point[7,0]]
+    end
+
+    it 'must maximum with multiple arguments' do
+	subject.minmax(7,-1).must_equal [Point[0,-1], Point[7,0]]
+    end
+end
+
     describe "arithmetic" do
 	let(:left) { Point[1,2] }
 	let(:right) { Point[3,4] }

data/test/geometry/square.rb

@@ -65,6 +65,10 @@ describe Geometry::Square do
 	    subject.closed?.must_equal true
 	end
 
+	it 'must have edges' do
+	    subject.edges.must_equal [Edge([2,3], [3,3]), Edge.new([3,3], [3,4]), Edge.new([3,4], [2,4]), Edge.new([2,4], [2,3])]
+	end
+
 	it "must have an origin accessor" do
 	    subject.origin.must_equal Point[2,3]
 	end
@@ -80,6 +84,10 @@ describe Geometry::Square do
 	it "must have a min property that returns the lower left corner of the bounding rectangle" do
 	    subject.min.must_equal Point[2, 3]
 	end
+
+	it 'must have points' do
+	    subject.points.must_equal [Point[2,3], Point[3,3], Point[3,4], Point[2,4]]
+	end
     end
 end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: geometry
 version: !ruby/object:Gem::Version
-  version: '6.3'
+  version: '6.4'
 platform: ruby
 authors:
 - Brandon Fosdick
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-08-17 00:00:00.000000000 Z
+date: 2014-11-18 00:00:00.000000000 Z
 dependencies: []
 description: Geometric primitives and algorithms for Ruby
 email:
@@ -27,6 +27,7 @@ files:
 - lib/geometry.rb
 - lib/geometry/annulus.rb
 - lib/geometry/arc.rb
+- lib/geometry/bezier.rb
 - lib/geometry/circle.rb
 - lib/geometry/cluster_factory.rb
 - lib/geometry/edge.rb
@@ -53,6 +54,7 @@ files:
 - test/geometry.rb
 - test/geometry/annulus.rb
 - test/geometry/arc.rb
+- test/geometry/bezier.rb
 - test/geometry/circle.rb
 - test/geometry/edge.rb
 - test/geometry/line.rb
@@ -86,7 +88,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - '>='
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '2.0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - '>='
@@ -102,6 +104,7 @@ test_files:
 - test/geometry.rb
 - test/geometry/annulus.rb
 - test/geometry/arc.rb
+- test/geometry/bezier.rb
 - test/geometry/circle.rb
 - test/geometry/edge.rb
 - test/geometry/line.rb