aurora-geometry 0.0.2

data/test/geometry.rb

@@ -0,0 +1,5 @@
+require 'minitest/autorun'
+require 'geometry'
+
+describe Geometry do
+end

data/test/geometry/arc.rb

@@ -0,0 +1,25 @@
+require 'minitest/autorun'
+require 'geometry/arc'
+
+describe Geometry::Arc do
+    Arc = Geometry::Arc
+
+    describe "when constructed" do
+	it "must accept a center point, radius, start and end angles" do
+	    arc = Geometry::Arc.new center:[1,2], radius:3, start:0, end:90
+	    arc.must_be_kind_of Geometry::Arc
+	    arc.center.must_equal Point[1,2]
+	    arc.radius.must_equal 3
+	    arc.start_angle.must_equal 0
+	    arc.end_angle.must_equal 90
+	end
+
+	it "must create an Arc from center, start and end points" do
+	    arc = Geometry::Arc.new center:[1,2], start:[3,4], end:[5,6]
+	    arc.must_be_kind_of Geometry::Arc
+	    arc.center.must_equal Point[1,2]
+	    arc.first.must_equal Point[3,4]
+	    arc.last.must_equal Point[5,6]
+	end
+    end
+end

data/test/geometry/circle.rb

@@ -0,0 +1,112 @@
+require 'minitest/autorun'
+require 'geometry/circle'
+
+describe Geometry::Circle do
+    Circle = Geometry::Circle
+
+    describe "when constructed with center and radius arguments" do
+	let(:circle) { Circle.new [1,2], 3 }
+
+	it "must create a Circle" do
+	    circle.must_be_instance_of(Circle)
+	end
+	
+	it "must have a center point accessor" do
+	    circle.center.must_equal Point[1,2]
+	end
+	
+	it "must have a radius accessor" do
+	    circle.radius.must_equal 3
+	end
+
+	it "must compare equal" do
+	    circle.must_equal Circle.new([1,2], 3)
+	end
+    end
+
+    describe "when constructed with named center and radius arguments" do
+	let(:circle) { Circle.new :center => [1,2], :radius => 3 }
+	
+	it "must create a Circle" do
+	    circle.must_be_instance_of(Circle)
+	end
+	
+	it "must have a center point accessor" do
+	    circle.center.must_equal Point[1,2]
+	end
+	
+	it "must have a radius accessor" do
+	    circle.radius.must_equal 3
+	end
+
+	it "must compare equal" do
+	    (circle == Circle.new(:center => [1,2], :radius => 3)).must_equal true
+	end
+    end
+
+    describe "when constructed with named center and diameter arguments" do
+	let(:circle) { Circle.new center:[1,2], diameter:4 }
+
+	it "must be a CenterDiameterCircle" do
+	    circle.must_be_instance_of(Geometry::CenterDiameterCircle)
+	    circle.must_be_kind_of(Circle)
+	end
+
+	it "must have a center" do
+	    circle.center.must_equal Point[1,2]
+	end
+
+	it "must have a diameter" do
+	    circle.diameter.must_equal 4
+	end
+
+	it "must calculate the correct radius" do
+	    circle.radius.must_equal 2
+	end
+
+	it "must compare equal" do
+	    circle.must_equal Circle.new([1,2], :diameter => 4)
+	end
+    end
+
+    describe "when constructed with a diameter and no center" do
+	let(:circle) { Circle.new :diameter => 4 }
+
+	it "must be a CenterDiameterCircle" do
+	    circle.must_be_instance_of(Geometry::CenterDiameterCircle)
+	    circle.must_be_kind_of(Circle)
+	end
+
+	it "must have a nil center" do
+	    circle.center.must_be_kind_of Geometry::PointZero
+	end
+
+	it "must have a diameter" do
+	    circle.diameter.must_equal 4
+	end
+
+	it "must calculate the correct radius" do
+	    circle.radius.must_equal 2
+	end
+    end
+
+    describe "properties" do
+	subject { Circle.new center:[1,2], :diameter => 4 }
+
+	it "must have a bounds property that returns a Rectangle" do
+	    subject.bounds.must_equal Rectangle.new([-1,0], [3,4])
+	end
+
+	it "must have a minmax property that returns the corners of the bounding rectangle" do
+	    subject.minmax.must_equal [Point[-1,0], Point[3,4]]
+	end
+
+	it "must have a max property that returns the upper right corner of the bounding rectangle" do
+	    subject.max.must_equal Point[3,4]
+	end
+
+	it "must have a min property that returns the lower left corner of the bounding rectangle" do
+	    subject.min.must_equal Point[-1,0]
+	end
+    end
+end

data/test/geometry/edge.rb

@@ -0,0 +1,132 @@
+require 'minitest/autorun'
+require 'geometry/edge'
+
+def Edge(*args)
+    Geometry::Edge.new(*args)
+end
+
+describe Geometry::Edge do
+    Edge = Geometry::Edge
+    subject { Geometry::Edge.new [0,0], [1,1] }
+
+    it "must create an Edge object" do
+	edge = Edge.new([0,0], [1,0])
+	assert_kind_of(Geometry::Edge, edge)
+	assert_equal(Geometry::Point[0,0], edge.first)
+	assert_equal(Geometry::Point[1,0], edge.last)
+    end
+
+    it "must handle equality" do
+	edge1 = Edge.new([1,0], [0,1])
+	edge2 = Edge.new([1,0], [0,1])
+	edge3 = Edge.new([1,1], [5,5])
+	assert_equal(edge1, edge2)
+	edge1.wont_equal edge3
+    end
+
+    it "must return the height of the edge" do
+	edge = Edge([0,0], [1,1])
+	assert_equal(1, edge.height)
+    end
+
+    it "must return the width of the edge" do
+	edge = Edge([0,0], [1,1])
+	assert_equal(1, edge.width)
+    end
+
+    it "must convert an Edge to a Vector" do
+	Edge.new([0,0], [1,0]).vector.must_equal Vector[1,0]
+    end
+
+    it "must return the normalized direction of a vector" do
+	Edge.new([0,0], [1,0]).direction.must_equal Vector[1,0]
+    end
+
+    it "must return true for parallel edges" do
+	Edge.new([0,0], [1,0]).parallel?(Edge.new([0,0], [1,0])).must_equal 1
+	Edge.new([0,0], [1,0]).parallel?(Edge.new([1,0], [2,0])).must_equal 1
+	Edge.new([0,0], [1,0]).parallel?(Edge.new([3,0], [4,0])).must_equal 1
+	Edge.new([0,0], [1,0]).parallel?(Edge.new([3,1], [4,1])).must_equal 1
+    end
+
+    it "must return false for non-parallel edges" do
+	Edge.new([0,0], [2,0]).parallel?(Edge.new([1,-1], [1,1])).must_equal false
+    end
+
+    it "must clone and reverse" do
+	reversed = subject.reverse
+	reversed.to_a.must_equal subject.to_a.reverse
+	reversed.wont_be_same_as subject
+    end
+
+    it "must reverse itself" do
+	original = subject.to_a
+	subject.reverse!
+	subject.to_a.must_equal original.reverse
+    end
+
+    describe "spaceship" do
+	it "ascending with a Point" do
+	    edge = Edge.new [0,0], [1,1]
+	    (edge <=> Point[0,0]).must_equal 0
+	    (edge <=> Point[1,0]).must_equal -1
+	    (edge <=> Point[0,1]).must_equal 1
+	    (edge <=> Point[2,2]).must_equal nil
+	end
+
+	it "descending with a Point" do
+	    edge = Edge.new [1,1], [0,0]
+	    (edge <=> Point[0,0]).must_equal 0
+	    (edge <=> Point[1,0]).must_equal 1
+	    (edge <=> Point[0,1]).must_equal -1
+	    (edge <=> Point[2,2]).must_equal nil
+	end
+    end
+
+    describe "when finding an intersection" do
+	it "must find the intersection of two end-intersecting Edges" do
+	    intersection = Edge.new([0,0],[1,1]).intersection(Edge.new([0,1],[1,1]))
+	    intersection.must_be_kind_of Geometry::Point
+	    intersection.must_equal Geometry::Point[1,1]
+	end
+
+	it "must find the intersection of two collinear end-intersecting Edges" do
+	    intersection = Edge.new([2,2], [0,2]).intersection(Edge.new([3,2], [2,2]))
+	    intersection.must_be_kind_of Geometry::Point
+	    intersection.must_equal Geometry::Point[2,2]
+
+	    intersection = Edge.new([0,2], [2,2]).intersection(Edge.new([2,2], [3,2]))
+	    intersection.must_be_kind_of Geometry::Point
+	    intersection.must_equal Geometry::Point[2,2]
+	end
+
+	it "must find the itersection of two crossed Edges" do
+	    edge1 = Edge.new [0.0, 0], [2.0, 2.0]
+	    edge2 = Edge.new [2.0, 0], [0.0, 2.0]
+	    intersection = edge1.intersection edge2
+	    intersection.must_be_kind_of Geometry::Point
+	    intersection.must_equal Geometry::Point[1,1]
+	end
+
+	it "must return nil for two edges that do not intersect" do
+	    Edge.new([0,0],[1,0]).intersection(Edge.new([0,1],[1,1])).must_equal nil
+	end
+
+	it "must return true for two collinear and overlapping edges" do
+	    Edge.new([0,0],[2,0]).intersection(Edge.new([1,0],[3,0])).must_equal true
+	end
+
+	it "must return false for collinear but non-overlapping edges" do
+	    Edge.new([0,0],[2,0]).intersection(Edge.new([3,0],[4,0])).must_equal false
+	    Edge.new([0,0],[0,2]).intersection(Edge.new([0,3],[0,4])).must_equal false
+	end
+
+	it "must return nil for two parallel but not collinear edges" do
+	    Edge.new([0,0],[2,0]).intersection(Edge.new([1,1],[3,1])).must_equal nil
+	end
+
+	it "must return nil for two perpendicular but not interseting edges" do
+	    Edge.new([0, 0], [2, 0]).intersection(Edge.new([3, 3], [3, 1])).must_equal nil
+	end
+    end
+end

data/test/geometry/line.rb

@@ -0,0 +1,132 @@
+require 'minitest/autorun'
+require 'geometry/line'
+
+describe Geometry::Line do
+    Line = Geometry::Line
+    Point = Geometry::Point
+
+    describe "when initializing" do
+	it "must accept two named points" do
+	    line = Line.new(from:Point[0,0], to:Point[10,10])
+	    line.must_be_kind_of(Line)
+	    line.must_be_instance_of(Geometry::TwoPointLine)
+	    line.first.must_equal Point[0,0]
+	    line.last.must_equal Point[10,10]
+	end
+
+	it "must accept named start and end points" do
+	    line = Line.new(start:Point[0,0], end:Point[10,10])
+	    line.must_be_kind_of(Line)
+	    line.must_be_instance_of(Geometry::TwoPointLine)
+	    line.first.must_equal Point[0,0]
+	    line.last.must_equal Point[10,10]
+	end
+
+	it "must raise an exception when no arguments are given" do
+	    -> { Line.new }.must_raise ArgumentError
+	end
+    end
+
+    it "create a Line object from 2 Points" do
+	line = Geometry::Line[Geometry::Point[0,0], Geometry::Point[10,10]]
+	assert_kind_of(Geometry::Line, line)
+	assert_kind_of(Geometry::TwoPointLine, line)
+    end
+    it "create a Line object from two arrays" do
+	line = Geometry::Line[[0,0], [10,10]]
+	assert(line.is_a?(Geometry::Line))
+	assert_kind_of(Geometry::TwoPointLine, line)
+	assert_kind_of(Geometry::Point, line.first)
+	assert_kind_of(Geometry::Point, line.last)
+    end
+    it "create a Line object from two Vectors" do
+	line = Geometry::Line[Vector[0,0], Vector[10,10]]
+	assert(line.is_a?(Geometry::Line))
+	assert_kind_of(Geometry::TwoPointLine, line)
+    end
+
+    it "create a Line from a slope and y-intercept" do
+	line = Geometry::Line[0.75, 5]
+	assert(line.is_a?(Geometry::Line))
+	assert_kind_of(Geometry::SlopeInterceptLine, line)
+	assert_equal(5, line.intercept)
+	assert_equal(0.75, line.slope)
+    end
+
+    it "create a Line from a Rational slope and y-intercept" do
+	line = Geometry::Line[Rational(3,4), 5]
+	assert_kind_of(Geometry::SlopeInterceptLine, line)
+	assert(line.is_a?(Geometry::Line))
+	assert_equal(Rational(3,4), line.slope)
+    end
+
+    it "have a special constructor for horizontal lines" do
+	line = Geometry::Line.horizontal
+	assert(line.horizontal?)
+    end
+    it "have a special constructor for vertical lines" do
+	line = Geometry::Line.vertical
+	assert(line.vertical?)
+    end
+
+    it "have accessor for y-intercept" do
+	line = Geometry::Line[0.75, 5]
+	assert_equal(5, line.intercept)
+	assert_equal(5, line.intercept(:y))
+    end
+    it "have accessor for x-intercept" do
+	line = Geometry::Line.vertical(7)
+	assert_equal(7, line.intercept(:x))
+    end
+
+    it "return the correct x-intercept for vertical lines" do
+	line = Geometry::Line.vertical(7)
+	assert_equal(7, line.intercept(:x))
+    end
+    it "return the correct y-intercept for horizontal lines" do
+	line = Geometry::Line.horizontal(4)
+	assert_equal(4, line.intercept(:y))
+    end
+
+    it "return nil x-intercept for horizontal lines" do
+	line = Geometry::Line.horizontal
+	assert_nil(line.intercept(:x))
+    end
+    it "return nil y-intercept for vertical lines" do
+	line = Geometry::Line.vertical
+	assert_nil(line.intercept(:y))
+    end
+
+    it "implement inspect" do
+	line = Geometry::Line[[0,0], [10,10]]
+	assert_equal('Line(Point[0, 0], Point[10, 10])', line.inspect)
+    end
+    it "implement to_s" do
+	line = Geometry::Line[[0,0], [10,10]]
+	assert_equal('Line(Point[0, 0], Point[10, 10])', line.to_s)
+    end
+end
+
+describe Geometry::PointSlopeLine do
+    subject { Geometry::PointSlopeLine.new [1,2], 3 }
+
+    it "must have a slope attribute" do
+	subject.slope.must_equal 3
+    end
+end
+
+describe Geometry::SlopeInterceptLine do
+    subject { Geometry::SlopeInterceptLine.new 3, 2 }
+
+    it "must have a slope attribute" do
+	subject.slope.must_equal 3
+    end
+end
+
+describe Geometry::TwoPointLine do
+    subject { Geometry::TwoPointLine.new [1,2], [3,4] }
+
+    it "must have a slope attribute" do
+	subject.slope.must_equal 1
+    end
+end

data/test/geometry/obround.rb

@@ -0,0 +1,25 @@
+require 'minitest/autorun'
+require 'geometry/obround'
+
+describe Geometry::Obround do
+    Obround = Geometry::Obround
+
+    describe "when constructed" do
+	it "must accept two Points" do
+	    obround = Geometry::Obround.new [1,2], [3,4]
+	    obround.must_be_kind_of Geometry::Obround
+	end
+
+	it "must accept a width and height" do
+	    obround = Geometry::Obround.new 2, 3
+	    obround.must_be_kind_of Geometry::Obround
+	    obround.height.must_equal 3
+	    obround.width.must_equal 2
+	end
+
+	it "must compare equal" do
+	    obround = Geometry::Obround.new [1,2], [3,4]
+	    obround.must_equal Obround.new([1,2], [3,4])
+	end
+    end
+end

data/test/geometry/path.rb

@@ -0,0 +1,66 @@
+require 'minitest/autorun'
+require 'geometry/path'
+
+describe Geometry::Path do
+    describe "construction" do
+	it "must create a Path with no arguments" do
+	    path = Geometry::Path.new
+	    path.must_be_kind_of Geometry::Path
+	    path.elements.wont_be_nil
+	    path.elements.size.must_equal 0
+	end
+
+	it "must create a Path from Points" do
+	    path = Geometry::Path.new Point[1,1], Point[2,2], Point[3,3]
+	    path.elements.size.must_equal 2
+	    path.elements.each {|a| a.must_be_kind_of Geometry::Edge }
+	end
+
+	it "with connected Edges" do
+	    path = Geometry::Path.new Edge.new([1,1], [2,2]), Edge.new([2,2], [3,3])
+	    path.elements.size.must_equal 2
+	    path.elements.each {|a| a.must_be_kind_of Geometry::Edge }
+	end
+
+	it "with disjoint Edges" do
+	    path = Geometry::Path.new Edge.new([1,1], [2,2]), Edge.new([3,3], [4,4])
+	    path.elements.size.must_equal 3
+	    path.elements.each {|a| a.must_be_kind_of Geometry::Edge }
+	end
+
+	it "with Points and Arcs" do
+	    path = Geometry::Path.new [0,0], [1.0,0.0], Arc.new(center:[1,1], radius:1, start:-90*Math::PI/180, end:0), [2.0,1.0], [1,2]
+	    path.elements.size.must_equal 3
+	    path.elements[0].must_be_kind_of Geometry::Edge
+	    path.elements[1].must_be_kind_of Geometry::Arc
+	    path.elements[2].must_be_kind_of Geometry::Edge
+	end
+
+	it "with Edges and Arcs" do
+	    path = Geometry::Path.new Edge.new([0,0], [1.0,0.0]), Arc.new(center:[1,1], radius:1, start:-90*Math::PI/180, end:0), Edge.new([2.0,1.0], [1,2])
+	    path.elements.size.must_equal 3
+	    path.elements[0].must_be_kind_of Geometry::Edge
+	    path.elements[1].must_be_kind_of Geometry::Arc
+	    path.elements[2].must_be_kind_of Geometry::Edge
+	end
+
+	it "with disjoint Edges and Arcs" do
+	    path = Geometry::Path.new Edge.new([0,0], [1,0]), Arc.new(center:[2,1], radius:1, start:-90*Math::PI/180, end:0), Edge.new([3,1], [1,2])
+	    path.elements.size.must_equal 4
+	    path.elements[0].must_be_kind_of Geometry::Edge
+	    path.elements[1].must_be_kind_of Geometry::Edge
+	    path.elements[2].must_be_kind_of Geometry::Arc
+	    path.elements[3].must_be_kind_of Geometry::Edge
+	end
+
+	it "with disjoint Arcs" do
+	    path = Geometry::Path.new Arc.new(center:[2,1], radius:1, start:-90*Math::PI/180, end:0), Arc.new(center:[3,1], radius:1, start:-90*Math::PI/180, end:0)
+	    path.elements.size.must_equal 3
+	    path.elements[0].must_be_kind_of Geometry::Arc
+	    path.elements[1].must_be_kind_of Geometry::Edge
+	    path.elements[2].must_be_kind_of Geometry::Arc
+
+	    path.elements[0].last.must_equal path.elements[1].first
+	end
+    end
+end