geometry_3d 0.1.1 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: b6be9663a382709ce88d58a88343d355c8c11889
-  data.tar.gz: 434c0d1cad5c1474523ecdf2e3d025d06cf25a6a
+  metadata.gz: 209509ba9f34482785365903342f230d4bce3fdd
+  data.tar.gz: 93fe5d2aa4735fc0f8ad65263e6da246273981cf
 SHA512:
-  metadata.gz: f45cfb2296046a337a1628970c8e7b371791b593d1399088f5a7897c7a9468914d61cce976b455fa74866702de54d45a56669e03dcc49dffab943879c7ec4bf4
-  data.tar.gz: 728cd85b9e419cde91e666a1ba269ef355207eef0fe158a318629b9059f3facebf0917df4af8b52103415c563654421a0a9df6ecfac64eade17c560279051d10
+  metadata.gz: 8cd04971fd4daba8edc0c0b46882370afaf967d91c030963c562dab267e0a629a2191100c9bebfab2e54c4d139a343aeb2751516f0c7dd91e5fb95fffad25ccb
+  data.tar.gz: 3de679ef382e3f6a838b57858f62d632865c9be5b71723a8e34567330eb3da8db9d804a10e0cc9b649e882e3e29f84235ab9f315b5ba8ddf800af56e21c377fc

data/lib/geometry_3d.rb

@@ -4,4 +4,5 @@ require_relative './geometry_3d/line'
 require_relative './geometry_3d/plane'
 require_relative './geometry_3d/triangle'
 require_relative './geometry_3d/circle'
+require_relative './geometry_3d/sphere.rb'
 require_relative './geometry_3d/equation.rb'

data/lib/geometry_3d/circle.rb

@@ -3,7 +3,7 @@ class Circle
   attr_accessor :radius
   attr_accessor :vector
 
-  def initialize(point, vector, radius)
+  def initialize(point = Point.new(0, 0, 0), vector = Vector.new(0, 0, 1), radius)
     @point = point
     @radius = radius
     @vector = vector
@@ -34,6 +34,5 @@ class Circle
   def perimeter
     2 * Math::PI * radius
   end
-
 end
 

data/lib/geometry_3d/line.rb

@@ -22,19 +22,121 @@ class Line
     Line.new(first_point, v)
   end
 
-  # Find intersecting point of two lines.
+  # Finds the intersecting point of two lines. If the two lines do not intersect returns nil.
   #
   # Example:
-  #   >> Line.new(Point.new(1,-2,3), Vector.new(5,2,-1)).find_intersecting_point(Line.new(Point.new(-4,-4,1), Vector.new(-1,3,-1)))
-  #   => Point.new(-4, -4, 4)
+  #   >> Line.new(Point.new(4, 19, 12), Vector.new(1, 6, 5)).find_intersecting_point_with_line(Line.new(Point.new(-3, -15, -19), Vector.new(2, 8, 8)))
+  #   => Point.new(1, 1, -3)
   #
   # Arguments:
   #   line: (Line)
 
-  def find_intersecting_point(line)
-    eq1 = LinearEquation.new(vector.x, -line.vector.x, point.x - line.point.x)
-    eq2 = LinearEquation.new(vector.y, -line.vector.y, point.y - line.point.y)
-    find_point (eq1.solve_system(eq2)[0])
+  def find_intersecting_point_with_line(line)
+    if (intersect? line)
+      eq1 = LinearEquation.new(vector.x, -line.vector.x, point.x - line.point.x)
+      eq2 = LinearEquation.new(vector.y, -line.vector.y, point.y - line.point.y)
+      find_point (eq1.solve_system(eq2)[0])
+    end
+  end
+
+  # Find intersecting point of line and plane. If the line and the plane do not intersect nil is returned.
+  #
+  # Example:
+  #   >> Line.new(Point.new(1, 0, 1), Vector.new(3, -2, 1)).find_intersecting_point_with_plane(Plane.new(1, 1, 1, -6))
+  #   => Point.new(7, -4, 3)
+  #
+  # Arguments:
+  #   plane: (Plane)
+
+  def find_intersecting_point_with_plane(plane)
+    if (intersect_plane? plane)
+      find_point(- plane.substitute(point) / (plane.substitute(vector) - plane.d).to_f)
+    end
+  end
+
+  # Find the angle(degrees) between line and plane. If the line and the plane do not intersect nil is returned.
+  #
+  # Example:
+  #   >> Line.new(Point.new(1, 0, 1), Vector.new(2, 1, 2)).find_angle_with_plane(Plane.new(1, 1, 0, -6))
+  #   => 45
+  #
+  # Arguments:
+  #   plane: (Plane)
+
+  def find_angle_with_plane(plane)
+    if (intersect_plane? plane)
+      numer = (vector.scalar_product(plane.find_normal_vector)).abs
+      denom = (vector.length * plane.find_normal_vector.length)
+      Math.asin(numer / denom) * (180 / Math::PI)
+    end
+  end
+
+  # Check if two lines are parallel.
+  #
+  # Example:
+  #   >> Line.new(Point.new(1, 0, 1), Vector.new(3, -2, 1)).parallel?(Line.new(Point.new(2, 0, 1), Vector.new(6, -4, 2)))
+  #   => true
+  #
+  # Arguments:
+  #   line: (Line)
+
+  def parallel? (line)
+    vector.x * line.vector.y == vector.y * line.vector.x and vector.y * line.vector.z == vector.z * line.vector.y
+  end
+
+  # Check if two lines intersect.
+  #
+  # Example:
+  #   >> Line.new(Point.new(4, 19, 12), Vector.new(1, 6, 5)).intersect?(Line.new(Point.new(-3, -15, -19), Vector.new(2, 8, 8)))
+  #   => true
+  #
+  # Arguments:
+  #   line: (Line)
+
+  def intersect?(line)
+      eq1 = LinearEquation.new(vector.x, -line.vector.x, point.x - line.point.x)
+      eq2 = LinearEquation.new(vector.y, -line.vector.y, point.y - line.point.y)
+      eq3 = LinearEquation.new(vector.z, -line.vector.z, point.z - line.point.z)
+      (eq1.solve_system(eq2) == eq2.solve_system(eq3)) and (not parallel? line)
+  end
+
+  # Check if two lines are skew.
+  #
+  # Example:
+  #   >> Line.new(Point.new(4, -5, 1), Vector.new(2, 4, 3)).skew?(Line.new(Point.new(2, -1, 0), Vector.new(1, 3, 2)))
+  #   => true
+  #
+  # Arguments:
+  #   line: (Line)
+
+  def skew?(line)
+    not (parallel? line) and not(intersect? line)
+  end
+
+  # Check if a line and a plane are parallel.
+  #
+  # Example:
+  #   >> Line.new(Point.new(4, -5, 1), Vector.new(2, 4, 3)).parallel_to_plane?(Plane.new(1, 1, 1, 3))
+  #   => true
+  #
+  # Arguments:
+  #   plane: (Plane)
+
+  def parallel_to_plane?(plane)
+    plane.find_normal_vector.scalar_product(vector) == 0
+  end
+
+  # Check if a line and a plane intersect.
+  #
+  # Example:
+  #   >> Line.new(Point.new(4, -5, 1), Vector.new(2, 4, 3)).intersect_plane?(Plane.new(1, 2, 1, 3))
+  #   => true
+  #
+  # Arguments:
+  #   plane: (Plane)
+
+  def intersect_plane?(plane)
+    not parallel_to_plane? plane
   end
 
   def ==(line)

data/lib/geometry_3d/plane.rb

@@ -28,8 +28,6 @@ class Plane
     construct_with_two_vectors_and_point(vector1, vector2, point1)
   end
 
-
-
   # Construct plane with normal vector and passing through a point.
   #
   # Example:
@@ -92,18 +90,61 @@ class Plane
     Vector.construct_with_plane(self)
   end
 
+  # Find intersecting line of two planes. If the two planes do not intersect, returns nil.
+  #
+  # Example:
+  #   >> Plane.new(2, -5, 3, -12).find_intersecting_line_of_planes(Plane.new(3, 4, -3, -6))
+  #   => Line.new(Point.new(0, -18, -26), Vector.new(3, 15, 23))
+  # Arguments:
+  #   plane: (Plane)
+
+  def find_intersecting_line_of_planes(plane)
+    if (intersect? plane)
+      vector = find_normal_vector.cross_product(plane.find_normal_vector)
+      eq1 = LinearEquation.new(b, c, d)
+      eq2 = LinearEquation.new(plane.b, plane.c, plane.d)
+      array = eq1.solve_system(eq2)
+      point = Point.new(0, array[0], array[1])
+      Line.new(point, vector)
+    end
+  end
+
+  # Check if two planes are parallel.
+  #
+  # Example:
+  #   >> Plane.new(1, 2, 3, 5).parallel?(Plane.new(2, 4, 6, -4))
+  #   => true
+  #
+  # Arguments:
+  #   plane: (Plane)
+
+  def parallel?(plane)
+    a * plane.b == b * plane.a and c * plane.b == b * plane.c
+  end
+
+  # Check if two planes intersect.
+  #
+  # Example:
+  #   >> Plane.new(1, 2, 3, 5).parallel?(Plane.new(2, -4, 6, -4))
+  #   => true
+  #
+  # Arguments:
+  #   plane: (Plane)
+
+  def intersect?(plane)
+    not parallel? plane
+  end
 
+  def substitute(primitive)
+    to_a.take(3).zip(primitive.to_a).map { |a, b| a * b}.reduce(:+) + d
+  end
 
   def ==(plane)
-    #a == plane.a and b == plane.b and c == plane.c and d == plane.d
     to_a.zip(plane.to_a).map { |a, b| a == b}.reduce(:&)
   end
 
-
   private
   def self.find_d(array, point)
     - array.zip(point.to_a).map { |a, b| a * b }.reduce(:+)
   end
-
-
 end

data/lib/geometry_3d/point.rb

@@ -32,7 +32,7 @@ class Point
   #   plane: (Plane)
 
   def is_on_plane?(plane)
-    (plane.a * x + plane.b * y + plane.c * z + plane.d) == 0
+    plane.substitute(self) == 0
   end
 
   # Check if a point is on a line
@@ -48,20 +48,45 @@ class Point
     to_a.zip(line.point.to_a, line.vector.to_a).map { |a, b, c| (a - b) / c }.uniq.length == 1
   end
 
-  # Find the distance between two points
+  # Finds the distance between two points.
   #
   # Example:
-  #   >> Point.new(-7, -4, 3).distance_to(Point.new(17, 6, 2.5))
+  #   >> Point.new(-7, -4, 3).distance_to_point(Point.new(17, 6, 2.5))
   #   => 26.004807247891687
   #
   # Arguments:
   #   point: (Point)
 
-  def distance_to(point)
+  def distance_to_point(point)
     to_a.zip(point.to_a).map{|a, b| (b - a) ** 2}.reduce(:+) ** 0.5
   end
 
-  # Find the midpoint between two points
+  # Finds the distance between point and line.
+  #
+  # Example:
+  #   >> Point.new(0, 2, 3).distance_to_line(Line.new(Point.new(3, 1, -1), Vector.new(2, 1, 2)))
+  #   => 5
+  # Arguments:
+  #   line: (Line)
+
+  def distance_to_line(line)
+    numer = Vector.construct_with_two_points(self, line.point).cross_product(line.vector)
+    numer.length / line.vector.length
+  end
+
+  # Finds the distance between point and plane.
+  #
+  # Example:
+  #   >> Point.new(4, -4, 3).distance_to_plane(Plane.new(2, -2, 5, 8))
+  #   => 6.789028582272215
+  # Arguments:
+  #   plane: (Plane)
+
+  def distance_to_plane(plane)
+    plane.substitute(self).abs / (plane.find_normal_vector.length)
+  end
+
+  # Finds the midpoint between two points.
   #
   # Example:
   #   >> Point.new(-7, -4, 3).get_midpoint(Point.new(17, 6, 2.5))
@@ -78,15 +103,12 @@ class Point
     [x, y, z]
   end
 
-
   def ==(point)
     @x == point.x and @y == point.y and @z == point.z
   end
 
-  def round
-    Point.new(*to_a.map{|x| x.round(4)})
+  def round(number)
+    Point.new(*to_a.map{|x| x.round(number)})
   end
-
-
 end
 

data/lib/geometry_3d/sphere.rb

@@ -0,0 +1,62 @@
+class Sphere
+  attr_accessor :point
+  attr_accessor :radius
+
+  def initialize(point, radius)
+    @point = point
+    @radius = radius
+  end
+
+  # Find the surface area of a sphere.
+  #
+  # Example:
+  #   >> Sphere.new(Point.new(1, 2, 3), 3).surface_area
+  #   => 113.09733552923254
+  #
+  # Arguments:
+  #   no
+
+  def surface_area
+    4 * Math::PI * radius ** 2
+  end
+
+  # Find the volume of a sphere.
+  #
+  # Example:
+  #   >> Sphere.new(Point.new(1, 2, 3), 3).volume
+  #   => 113.09733552923254
+  #
+  # Arguments:
+  #   no
+
+  def volume
+    (4.0 / 3) * Math::PI * radius ** 3
+  end
+
+  # Find the circumference of a sphere.
+  #
+  # Example:
+  #   >> Sphere.new(Point.new(1, 2, 3), 3).circumference
+  #   => 18.84955592153876
+  #
+  # Arguments:
+  #   no
+
+  def circumference
+    Circle.new(radius).perimeter
+  end
+
+  # Checks if two spheres intersect/
+  #
+  # Example:
+  #   >> Sphere.new(Point.new(-7, -4, 3), 20).intersect?(Sphere.new(Point.new(17, 6, 2.5), 7))
+  #   => true
+  #
+  # Arguments:
+  #   no
+
+  def intersect?(sphere)
+    point.distance_to_point(sphere.point) <= (radius + sphere.radius)
+  end
+
+end

data/lib/geometry_3d/triangle.rb

@@ -9,6 +9,175 @@ class Triangle
     @point_c = point_c
   end
 
+  # Finds the length of the AB side of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).length_ab
+  #   => 6.164414002968976
+  #
+  # Arguments:
+  #   no
+
+  def length_ab
+    point_a.distance_to_point(point_b)
+  end
+
+  # Finds the length of the BC side of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).length_bc
+  #   => 6.164414002968976
+  #
+  # Arguments:
+  #   no
+
+  def length_bc
+    point_b.distance_to_point(point_c)
+  end
+
+  # Finds the length of the AC side of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).length_ac
+  #   => 2
+  #
+  # Arguments:
+  #   no
+
+  def length_ac
+    point_a.distance_to_point(point_c)
+  end
+
+  # Finds the length of the height form point A of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).length_height_a
+  #   => 6.082762530298219
+  #
+  # Arguments:
+  #   no
+
+  def length_height_a
+    point_a.distance_to_line(get_line_bc)
+  end
+
+  # Finds the length of the height form point B of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).length_height_b
+  #   => 1.9735087641318605
+  #
+  # Arguments:
+  #   no
+
+  def length_height_b
+    point_b.distance_to_line(get_line_ac)
+  end
+
+  # Finds the length of the height form point C of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.+new(2, 2, 7), Point.new(1, 3, 1)).length_height_c
+  #   => 6.082762530298219
+  #
+  # Arguments:
+  #   no
+
+  def length_height_c
+    point_c.distance_to_line(get_line_ab)
+  end
+
+  # Finds the length of the median form point A of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.+new(2, 2, 7), Point.new(1, 3, 1)).length_median_a
+  #   => 3.391164991562634
+  #
+  # Arguments:
+  #   no
+
+  def length_median_a
+    point_a.distance_to_point(point_b.get_midpoint point_c)
+  end
+
+  # Finds the length of the median form point B of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.+new(2, 2, 7), Point.new(1, 3, 1)).length_median_b
+  #   => 6.08276253029818
+  #
+  # Arguments:
+  #   no
+
+  def length_median_b
+    point_b.distance_to_point(point_a.get_midpoint point_c)
+  end
+
+  # Finds the length of the median form point C of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.+new(2, 2, 7), Point.new(1, 3, 1)).length_median_c
+  #   => 3.391164991562634
+  #
+  # Arguments:
+  #   no
+
+  def length_median_c
+    point_c.distance_to_point(point_a.get_midpoint point_b)
+  end
+
+  # Finds the area of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).area
+  #   => 1.9735087641318605
+  #
+  # Arguments:
+  #   no
+
+  def area
+    (length_bc * length_height_a) / 2.0
+  end
+
+  # Finds the perimeter of the triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).perimeter
+  #   => 14.32882800593795
+  #
+  # Arguments:
+  #   no
+
+  def perimeter
+    length_ab + length_ac + length_bc
+  end
+
+  # Finds the radius of the inscribed circle in triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).radius_of_inscribed_circle
+  #   => 0.8490244321137063
+  #
+  # Arguments:
+  #   no
+
+  def radius_of_inscribed_circle
+    area / (perimeter / 2)
+  end
+
+  # Finds the radius of the circumscribed circle in triangle.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 1, 1), Point.new(2, 2, 7), Point.new(1, 3, 1)).radius_of_circumscribed_circle
+  #   => 3.123580758801788
+  #
+  # Arguments:
+  #   no
+
+  def radius_of_circumscribed_circle
+    (length_ab * length_bc * length_ac) / (4 * area)
+  end
+
   # Find the plane in which the triangle lies.
   #
   # Example:
@@ -22,6 +191,15 @@ class Triangle
     Plane.construct_with_three_points(point_a, point_b, point_c)
   end
 
+  # Find the line in which the height from the point A lies.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_height_a
+  #   => Line.new(Point.new(1, 2, 3), Vector.new(85, -136, -534))
+  #
+  # Arguments:
+  #   no
+
   # Find the line in which the AB side of the triangle lies.
   #
   # Example:
@@ -61,42 +239,84 @@ class Triangle
     Line.construct_with_two_points(point_a, point_c)
   end
 
+  # Find the line in which the height from the point A lies.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_height_a
+  #   => Line.new(Point.new(1, 2, 3), Vector.new(85, -136, -534))
+  #
+  # Arguments:
+  #   no
+
+  def get_line_height_a
+    l = get_line_bc
+    Line.new(point_a,  l.vector.cross_product(get_plane.find_normal_vector))
+  end
+
+  # Find the line in which the height from the point B lies.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_height_b
+  #   => Line.new(Point.new(4, 6, 9), Vector.new(441, -7, -798))
+  #
+  # Arguments:
+  #   no
+
+  def get_line_height_b
+    l = get_line_ac
+    Line.new(point_b,  l.vector.cross_product(get_plane.find_normal_vector))
+  end
+
+  # Find the line in which the height from the point C lies.
+  #
+  # Example:
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_height_c
+  #   => ine.new(Point.new(12, 11, 9), Vector.new(356, 129, -264))
+  #
+  # Arguments:
+  #   no
+
+  def get_line_height_c
+    l = get_line_ab
+    Line.new(point_c, l.vector.cross_product(get_plane.find_normal_vector))
+  end
+
   # Find the median of the triangle from the point A
   #
   # Example:
-  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_median_a
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_median_a
   #   => Line.new(Point.new(1, 2, 3), Vector.new(7, 6.5, 6))
   #
   # Arguments:
   #   no
 
-  def get_median_a
+  def get_line_median_a
     Line.construct_with_two_points(point_a, point_b.get_midpoint(point_c))
   end
 
   # Find the median of the triangle from the point B.
   #
   # Example:
-  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_median_b
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_median_b
   #   => Line.new(Point.new(4, 6, 9), Vector.new(2.5, 0.5, -3))
   #
   # Arguments:
   #   no
-#Line.new(Point.new(4, 6, 9), Vector.new(2, 0, -3)).find_intersecting_point(Line.new(Point.new(12, 11, 9), Vector.new(-10, -7, -3)))
-  def get_median_b
+
+  def get_line_median_b
     Line.construct_with_two_points(point_b, point_a.get_midpoint(point_c))
   end
 
   # Find the median of the triangle from the point C.
   #
   # Example:
-  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_median_c
+  #   >> Triangle.new(Point.new(1, 2, 3), Point.new(4, 6, 9), Point.new(12, 11, 9)).get_line_median_c
   #   => Line.new(Point.new(12, 11, 9), Vector.new(-9.5, -7, -3))
   #
   # Arguments:
   #   no
 
-  def get_median_c
+  def get_line_median_c
     Line.construct_with_two_points(point_c, point_a.get_midpoint(point_b))
   end
 
@@ -110,6 +330,6 @@ class Triangle
   #   no
 
   def get_centroid
-    get_median_a.find_intersecting_point(get_median_b)
+    get_line_median_a.find_intersecting_point_with_line(get_line_median_b)
   end
 end

data/lib/geometry_3d/vector.rb

@@ -50,6 +50,19 @@ class Vector
     Vector.new(*to_a.zip(vector.to_a).map { |a, b| a + b } )
   end
 
+  # Finds the scalar product of two vector.
+  #
+  # Example:
+  #   >> Vector.new(1, 2, 3).scalar_product(Vector.new(-2, 1, 2))
+  #   => 6
+  #
+  # Arguments:
+  #   vector: (Vector)
+
+  def scalar_product(vector)
+    to_a.zip(vector.to_a).map { |a, b| a * b }.reduce(:+)
+  end
+
   # Finds a vector perpendicular to both vectors.
   #
   # Example:
@@ -66,6 +79,19 @@ class Vector
     Vector.new(coordinate_x, coordinate_y, coordinate_z)
   end
 
+  # Finds the length of the vector.
+  #
+  # Example:
+  #   >> Vector.new(4, 0, 3).length
+  #   => 5
+  #
+  # Arguments:
+  #   vector: (Vector)
+
+  def length
+    to_a.map{ |a| a * a}.reduce(:+) ** 0.5
+  end
+
   def to_a()
     [x, y, z]
   end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: geometry_3d
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.2.0
 platform: ruby
 authors:
 - Guldjan Kupen
@@ -24,6 +24,7 @@ files:
 - lib/geometry_3d/line.rb
 - lib/geometry_3d/plane.rb
 - lib/geometry_3d/point.rb
+- lib/geometry_3d/sphere.rb
 - lib/geometry_3d/triangle.rb
 - lib/geometry_3d/vector.rb
 homepage: http://rubygems.org/gems/geometry_3d