perfect-shape 0.0.11 → 0.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: '097e027a1c0c026611e480d05bf6281c74db9228964f6f06c414637bb60af8b0'
-  data.tar.gz: e2bab91460ec298a74e4735a13a123bf7b5f0ae9d15f8b5544a77aa7733cd312
+  metadata.gz: 8bb743eb7a0d935839d671a33b58a30ea8eb65b945ee20e6016690fd0c6864f8
+  data.tar.gz: cd5b26777efcf931ed81a84ec63fee3dcaed5dfa3b878dc39350e6eb206f937e
 SHA512:
-  metadata.gz: a532c231809348346907d2f369df7380cbac384772c3fc6d9858bfa423f5da6f0fd15e9eda3f94404f5579ed3572cab87d3c8d99b19c50d776ae6e999a7ff5a1
-  data.tar.gz: 4d7b76430666115f21053b7417c290f6260fb99f278eb8397d53ddf1c5c4a84b48b1c87d49c977bdfc54cd513c801be49ca1e586d9c0d7501e4d2a5eb648f8e4
+  metadata.gz: 7adf8c29ae005e8f22c15e460dcf99befd28acef67a5387d950bef1d94781be6fce9cb25b725092892da83a6821b5b59bc699cf5c581af11133d90b4946ed29b
+  data.tar.gz: 334ef034a6f1010f49ad2fa2edc9dfccae994d0f8524427104100b6f4ccc83a63b276f731d483c494625111ad5a668ac05300c9b589ae57b801645d393130c38

data/CHANGELOG.md

@@ -1,5 +1,12 @@
 # Change Log
 
+## 0.1.0
+
+- `PerfectShape::Path` (having points or lines)
+- `PerfectShape::Path#contain?(x_or_point, y=nil, distance: 0)`
+- `PerfectShape::Path#point_crossings(x_or_point, y=nil)`
+- `PerfectShape::Path#==`
+
 ## 0.0.11
 
 - `PerfectShape::Polygon#==`
@@ -27,6 +34,8 @@
 
 ## 0.0.7
 
+- `PerfectShape::Polygon`
+- `PerfectShape::Polygon#contain?(x_or_point, y)` (Ray Casting Algorithm, aka Even-Odd Rule)
 - `PerfectShape::Shape#min_x`/`PerfectShape::Shape#min_y`/`PerfectShape::Shape#max_x`/`PerfectShape::Shape#max_y`/`PerfectShape::Shape#center_x`/`PerfectShape::Shape#center_y`/`PerfectShape::Shape#bounding_box`
 
 ## 0.0.6

data/README.md

@@ -1,25 +1,26 @@
-# Perfect Shape 0.0.11
+# Perfect Shape 0.1.0
 ## Geometric Algorithms
 [![Gem Version](https://badge.fury.io/rb/perfect-shape.svg)](http://badge.fury.io/rb/perfect-shape)
+[![Test](https://github.com/AndyObtiva/perfect-shape/actions/workflows/ruby.yml/badge.svg)](https://github.com/AndyObtiva/perfect-shape/actions/workflows/ruby.yml)
 
-`PerfectShape` is a collection of pure Ruby geometric algorithms that are mostly useful for GUI (Graphical User Interface) manipulation like checking containment of a mouse click point in popular geometry shapes such as rectangle, square, arc (open, chord, and pie), ellipse, circle, polygon (ray casting algorithm/even-odd rule), polyline, polyquad, polycubic, and paths containing lines, bezier curves, and quadratic curves.
+[`PerfectShape`](https://rubygems.org/gems/perfect-shape) is a collection of pure Ruby geometric algorithms that are mostly useful for GUI (Graphical User Interface) manipulation like checking containment of a mouse click [point](#perfectshapepoint) in popular geometry shapes such as [rectangle](#perfectshaperectangle), [square](#perfectshapesquare), [arc](#perfectshapearc) (open, chord, and pie), [ellipse](#perfectshapeellipse), [circle](#perfectshapecircle), [polygon](#perfectshapepolygon), polyline, polyquad, polycubic, and [paths](#perfectshapepath) containing [lines](#perfectshapeline), quadratic bézier curves, and cubic bézier curves (including both [Ray Casting Algorithm](https://en.wikipedia.org/wiki/Point_in_polygon#Ray_casting_algorithm), aka [Even-odd Rule](https://en.wikipedia.org/wiki/Even%E2%80%93odd_rule), and [Winding Number Algorithm](https://en.wikipedia.org/wiki/Point_in_polygon#Winding_number_algorithm), aka [Nonzero Rule](https://en.wikipedia.org/wiki/Nonzero-rule)).
 
-Additionally, `PerfectShape::Math` contains some purely mathematical algorithms.
+Additionally, [`PerfectShape::Math`](#perfectshapemath) contains some purely mathematical algorithms, like [IEEE 754-1985 Remainder](https://en.wikipedia.org/wiki/IEEE_754-1985).
 
-To ensure high accuracy, this library does all its mathematical operations with `BigDecimal` numbers.
+To ensure high accuracy, this library does all its mathematical operations with [`BigDecimal`](https://ruby-doc.org/stdlib-3.0.2/libdoc/bigdecimal/rdoc/BigDecimal.html) numbers.
 
 ## Setup
 
 Run:
 
 ```
-gem install perfect-shape -v 0.0.11
+gem install perfect-shape -v 0.1.0
 ```
 
 Or include in Bundler `Gemfile`:
 
 ```ruby
-gem 'perfect-shape', '~> 0.0.11'
+gem 'perfect-shape', '~> 0.1.0'
 ```
 
 And, run:
@@ -54,7 +55,7 @@ This is a base class for all shapes. It is not meant to be used directly. Subcla
 - `#center_x`: center x
 - `#center_y`: center y
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height just as those of shape
-- `#normalize_point(x_or_point, y = nil)`: normalizes point into an `Array` of (x,y) coordinates
+- `#normalize_point(x_or_point, y = nil)`: normalizes point into an `Array` of `[x,y]` coordinates
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
 ### `PerfectShape::PointLocation`
@@ -96,7 +97,7 @@ Includes `PerfectShape::PointLocation`
 
 ![point](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/point.png)
 
-Points are simply represented by an `Array` of (x,y) coordinates when used within other shapes, but when needing point-specific operations like `point_distance`, the `PerfectShape::Point` class can come in handy.
+Points are simply represented by an `Array` of `[x,y]` coordinates when used within other shapes, but when needing point-specific operations like `point_distance`, the `PerfectShape::Point` class can come in handy.
 
 - `::point_distance(x, y, px, py)`: Returns the distance from a point to another point
 - `::new(x_or_point=nil, y_arg=nil, x: nil, y: nil)`: constructs a point with (x,y) pair (default: 0,0) whether specified as `Array` of (x,y) pair, flat `x,y` args, or `x:, y:` kwargs.
@@ -119,12 +120,14 @@ Class
 
 Extends `PerfectShape::Shape`
 
+Includes `PerfectShape::MultiPoint`
+
 ![line](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/line.png)
 
 - `::relative_counterclockwise(x1, y1, x2, y2, px, py)`: Returns an indicator of where the specified point (px,py) lies with respect to the line segment from (x1,y1) to (x2,y2). The return value can be either 1, -1, or 0 and indicates in which direction the specified line must pivot around its first end point, (x1,y1), in order to point at the specified point (px,py). A return value of 1 indicates that the line segment must turn in the direction that takes the positive X axis towards the negative Y axis. In the default coordinate system used by Java 2D, this direction is counterclockwise. A return value of -1 indicates that the line segment must turn in the direction that takes the positive X axis towards the positive Y axis. In the default coordinate system, this direction is clockwise. A return value of 0 indicates that the point lies exactly on the line segment. Note that an indicator value of 0 is rare and not useful for determining collinearity because of floating point rounding issues. If the point is colinear with the line segment, but not between the end points, then the value will be -1 if the point lies “beyond (x1,y1)” or 1 if the point lies “beyond (x2,y2)”.
 - `::point_segment_distance_square(x1, y1, x2, y2, px, py)`: Returns the square of distance from a point to a line segment.
 - `::point_segment_distance(x1, y1, x2, y2, px, py)`: Returns the distance from a point to a line segment.
-- `::new(points: nil)`: constructs a polygon with `points` as `Array` of `Array`s of (x,y) pairs or flattened `Array` of alternating x and y values
+- `::new(points: nil)`: constructs a polygon with `points` as `Array` of `Array`s of `[x,y]` pairs or flattened `Array` of alternating x and y values
 - `#min_x`: min x
 - `#min_y`: min y
 - `#max_x`: max x
@@ -286,9 +289,11 @@ Class
 
 Extends `PerfectShape::Shape`
 
+Includes `PerfectShape::MultiPoint`
+
 ![polygon](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/polygon.png)
 
-- `::new(points: nil)`: constructs a polygon with `points` as `Array` of `Array`s of (x,y) pairs or flattened `Array` of alternating x and y values
+- `::new(points: nil)`: constructs a polygon with `points` as `Array` of `Array`s of `[x,y]` pairs or flattened `Array` of alternating x and y values
 - `#min_x`: min x
 - `#min_y`: min y
 - `#max_x`: max x
@@ -301,6 +306,34 @@ Extends `PerfectShape::Shape`
 - `#contain?(x_or_point, y=nil)`: checks if point is inside using the [Ray Casting Algorithm](https://en.wikipedia.org/wiki/Point_in_polygon) (aka [Even-Odd Rule](https://en.wikipedia.org/wiki/Even%E2%80%93odd_rule))
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+### `PerfectShape::Path`
+
+Class
+
+Extends `PerfectShape::Shape`
+
+Includes `PerfectShape::MultiPoint`
+
+![path](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/path.png)
+
+- `::new(shapes: nil, closed: false, winding_rule: :wind_non_zero)`: constructs a path with `shapes` as `Array` of shape objects, which can be `PerfectShape::Point` (or `Array` of `[x, y]` coordinates), or `PerfectShape::Line`. If a path is closed, its last point is automatically connected to its first point with a line segment. The winding rule can be `:wind_non_zero` (default) or `:wind_even_odd`.
+- `#shapes`: the shapes that the path is composed of
+- `#closed?`: returns `true` if closed and `false` otherwise
+- `#winding_rule`: returns winding rule (`:wind_non_zero` or `:wind_even_odd`)
+- `#points`: path points calculated (derived) from shapes
+- `#min_x`: min x
+- `#min_y`: min y
+- `#max_x`: max x
+- `#max_y`: max y
+- `#width`: width (from min x to max x)
+- `#height`: height (from min y to max y)
+- `#center_x`: center x
+- `#center_y`: center y
+- `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
+- `#contain?(x_or_point, y=nil)`: checks if point is inside path utilizing the configured winding rule, which can be the [Nonzero-Rule](https://en.wikipedia.org/wiki/Nonzero-rule) (aka [Winding Number Algorithm](https://en.wikipedia.org/wiki/Point_in_polygon#Winding_number_algorithm)) or the [Even-Odd Rule](https://en.wikipedia.org/wiki/Even%E2%80%93odd_rule) (aka [Ray Casting Algorithm](https://en.wikipedia.org/wiki/Point_in_polygon#Ray_casting_algorithm))
+- `#point_crossings(x_or_point, y=nil)`: calculates the number of times the given path crosses the ray extending to the right from (x,y)
+- `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
+
 ## Process
 
 [Glimmer Process](https://github.com/AndyObtiva/glimmer/blob/master/PROCESS.md)

data/VERSION

@@ -1 +1 @@
-0.0.11
+0.1.0

data/lib/perfect_shape/line.rb

@@ -182,6 +182,22 @@ module PerfectShape
                                  px, py)
         BigDecimal(::Math.sqrt(point_segment_distance_square(x1, y1, x2, y2, px, py)).to_s)
       end
+      
+      # Calculates the number of times the line from (x1,y1) to (x2,y2)
+      # crosses the ray extending to the right from (px,py).
+      # If the point lies on the line, then no crossings are recorded.
+      # +1 is returned for a crossing where the Y coordinate is increasing
+      # -1 is returned for a crossing where the Y coordinate is decreasing
+      def point_crossings(x1, y1, x2, y2, px, py)
+        return 0 if (py <  y1 && py <  y2)
+        return 0 if (py >= y1 && py >= y2)
+        # assert(y1 != y2);
+        return 0 if (px >= x1 && px >= x2)
+        return ((y1 < y2) ? 1 : -1) if (px <  x1 && px <  x2)
+        xintercept = x1 + (py - y1) * (x2 - x1) / (y2 - y1);
+        return 0 if (px >= xintercept)
+        (y1 < y2) ? 1 : -1
+      end
     end
     
     include MultiPoint
@@ -214,5 +230,16 @@ module PerfectShape
       return unless x && y
       Line.relative_counterclockwise(points[0][0], points[0][1], points[1][0], points[1][1], x, y)
     end
+    
+    # Calculates the number of times the line
+    # crosses the ray extending to the right from (px,py).
+    # If the point lies on the line, then no crossings are recorded.
+    # +1 is returned for a crossing where the Y coordinate is increasing
+    # -1 is returned for a crossing where the Y coordinate is decreasing
+    def point_crossings(x_or_point, y = nil)
+      x, y = normalize_point(x_or_point, y)
+      return unless x && y
+      Line.point_crossings(points[0][0], points[0][1], points[1][0], points[1][1], x, y)
+    end
   end
 end

data/lib/perfect_shape/math.rb

@@ -76,9 +76,9 @@ module PerfectShape
         super || ::Math.respond_to?(method_name, include_private)
       end
       
-      def method_missing(method_name, *args, **kwargs, &block)
+      def method_missing(method_name, *args, &block)
         if ::Math.respond_to?(method_name, true)
-          ::Math.send(method_name, *args, **kwargs, &block)
+          ::Math.send(method_name, *args, &block)
         else
           super
         end

data/lib/perfect_shape/path.rb

@@ -0,0 +1,201 @@
+# Copyright (c) 2021 Andy Maleh
+#
+# 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.
+
+require 'perfect_shape/shape'
+require 'perfect_shape/point'
+require 'perfect_shape/line'
+require 'perfect_shape/multi_point'
+
+module PerfectShape
+  # Mostly ported from java.awt.geom: https://docs.oracle.com/javase/8/docs/api/java/awt/geom/Path2D.html
+  class Path < Shape
+    include MultiPoint
+    include Equalizer.new(:shapes, :closed, :winding_rule)
+    
+    SHAPE_TYPES = [Array, Point, Line]
+    WINDING_RULES = [:wind_non_zero, :wind_even_odd]
+    
+    attr_reader :winding_rule
+    attr_accessor :shapes, :closed
+    alias closed? closed
+    
+    # Constructs Path with winding rule, closed status, and shapes (must always start with PerfectShape::Point or Array of [x,y] coordinates)
+    # Shape class types can be any of SHAPE_TYPES: Array (x,y coordinates), PerfectShape::Point, or PerfectShape::Line
+    # winding_rule can be any of WINDING_RULES: :wind_non_zero (default) or :wind_even_odd
+    def initialize(shapes: [], closed: false, winding_rule: :wind_non_zero)
+      self.closed = closed
+      self.winding_rule = winding_rule
+      self.shapes = shapes
+    end
+    
+    def points
+      @shapes.map do |shape|
+        case shape
+        when Point
+          shape.to_a
+        when Array
+          shape
+        when Line
+          shape.points.last.to_a
+#         when QuadraticBezierCurve # TODO
+#         when CubicBezierCurve # TODO
+        end
+      end.tap do |the_points|
+        the_points << @shapes.first.to_a if closed?
+      end
+    end
+    
+    def points=(some_points)
+      raise "Cannot assign points directly! Must set shapes instead and points are calculated from them automatically."
+    end
+    
+    def drawing_types
+      the_drawing_shapes = @shapes.map do |shape|
+        case shape
+        when Point
+          :move_to
+        when Array
+          :move_to
+        when Line
+          :line_to
+#         when QuadraticBezierCurve # TODO
+#         when CubicBezierCurve # TODO
+        end
+      end
+      the_drawing_shapes << :close if closed?
+      the_drawing_shapes
+    end
+    
+    def winding_rule=(value)
+      raise "Invalid winding rule: #{value}" unless WINDING_RULES.include?(value.to_s.to_sym)
+      @winding_rule = value
+    end
+    
+    # Checks if path contains point (two-number Array or x, y args)
+    # using the Nonzero-Rule (aka Winding Number Algorithm): https://en.wikipedia.org/wiki/Nonzero-rule
+    # or using the Even-Odd Rule (aka Ray Casting Algorithm): https://en.wikipedia.org/wiki/Even%E2%80%93odd_rule
+    #
+    # @param x The X coordinate of the point to test.
+    # @param y The Y coordinate of the point to test.
+    #
+    # @return {@code true} if the point lies within the bound of
+    # the path, {@code false} if the point lies outside of the
+    # path's bounds.
+    def contain?(x_or_point, y = nil)
+      x, y = normalize_point(x_or_point, y)
+      return unless x && y
+      if (x * 0.0 + y * 0.0) == 0.0
+        # N * 0.0 is 0.0 only if N is finite.
+        # Here we know that both x and y are finite.
+        return false if shapes.count < 2
+        mask = winding_rule == :wind_non_zero ? -1 : 1
+        (point_crossings(x, y) & mask) != 0
+      else
+        # Either x or y was infinite or NaN.
+        # A NaN always produces a negative response to any test
+        # and Infinity values cannot be "inside" any path so
+        # they should return false as well.
+        false
+      end
+    end
+    
+    # Calculates the number of times the given path
+    # crosses the ray extending to the right from (x,y).
+    # If the point lies on a part of the path,
+    # then no crossings are counted for that intersection.
+    # +1 is added for each crossing where the Y coordinate is increasing
+    # -1 is added for each crossing where the Y coordinate is decreasing
+    # The return value is the sum of all crossings for every segment in
+    # the path.
+    # The path must start with a PerfectShape::Point (initial location)
+    # The caller must check for NaN values.
+    # The caller may also reject infinite values as well.
+    def point_crossings(x_or_point, y = nil)
+      x, y = normalize_point(x_or_point, y)
+      return unless x && y
+      return 0 if shapes.count == 0
+      movx = movy = curx = cury = endx = endy = 0
+      coords = points.flatten
+      curx = movx = coords[0]
+      cury = movy = coords[1]
+      crossings = 0
+      ci = 2
+      1.upto(shapes.count - 1).each do |i|
+          case drawing_types[i]
+          when :move_to
+            if cury != movy
+              line = PerfectShape::Line.new(points: [[curx, cury], [movx, movy]])
+              crossings += line.point_crossings(x, y)
+            end
+            movx = curx = coords[ci]
+            ci += 1
+            movy = cury = coords[ci]
+            ci += 1
+          when :line_to
+            endx = coords[ci]
+            ci += 1
+            endy = coords[ci]
+            ci += 1
+            line = PerfectShape::Line.new(points: [[curx, cury], [endx, endy]])
+            crossings += line.point_crossings(x, y)
+            curx = endx;
+            cury = endy;
+#           when :quad_to # TODO
+#             crossings +=
+#                 Curve.point_crossings_for_quad(x, y,
+#                                             curx, cury,
+#                                             coords[ci++],
+#                                             coords[ci++],
+#                                             endx = coords[ci++],
+#                                             endy = coords[ci++],
+#                                             0);
+#             curx = endx;
+#             cury = endy;
+#           when :cubic_to # TODO
+#             crossings +=
+#                 Curve.point_crossings_for_cubic(x, y,
+#                                              curx, cury,
+#                                              coords[ci++],
+#                                              coords[ci++],
+#                                              coords[ci++],
+#                                              coords[ci++],
+#                                              endx = coords[ci++],
+#                                              endy = coords[ci++],
+#                                              0);
+#             curx = endx;
+#             cury = endy;
+          when :close
+            if cury != movy
+              line = PerfectShape::Line.new(points: [[curx, cury], [movx, movy]])
+              crossings += line.point_crossings(x, y)
+            end
+            curx = movx
+            cury = movy
+          end
+      end
+      if cury != movy
+        line = PerfectShape::Line.new(points: [[curx, cury], [movx, movy]])
+        crossings += line.point_crossings(x, y)
+      end
+      crossings
+    end
+  end
+end

data/lib/perfect_shape/point.rb

@@ -23,6 +23,7 @@ require 'perfect_shape/shape'
 require 'perfect_shape/point_location'
 
 module PerfectShape
+  # Point class includes point-specific operations like `#==`, `point_distance` and a fuzzy `contain?` matcher
   class Point < Shape
     class << self
       def point_distance(x, y, px, py)
@@ -78,5 +79,10 @@ module PerfectShape
       return unless x && y
       Point.point_distance(self.x, self.y, x, y)
     end
+    
+    # Convert to pair Array of x,y coordinates
+    def to_a
+      [self.x, self.y]
+    end
   end
 end

data/lib/perfect_shape/point_location.rb

@@ -20,6 +20,7 @@
 # WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 module PerfectShape
+  # Point location usually represents the top-left point in a shape
   module PointLocation
     attr_reader :x, :y
     

data/perfect-shape.gemspec

@@ -2,17 +2,17 @@
 # DO NOT EDIT THIS FILE DIRECTLY
 # Instead, edit Juwelier::Tasks in Rakefile, and run 'rake gemspec'
 # -*- encoding: utf-8 -*-
-# stub: perfect-shape 0.0.11 ruby lib
+# stub: perfect-shape 0.1.0 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "perfect-shape".freeze
-  s.version = "0.0.11"
+  s.version = "0.1.0"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
   s.require_paths = ["lib".freeze]
   s.authors = ["Andy Maleh".freeze]
-  s.date = "2021-12-20"
-  s.description = "Perfect Shape is a collection of pure Ruby geometric algorithms that are mostly useful for GUI manipulation like checking containment of a mouse click point in popular geometry shapes such as rectangle, square, arc (open, chord, and pie), ellipse, circle, polygon (Ray Casting Algorithm aka Even-Odd Rule), polyline, polyquad, polycubic, and paths containing lines, bezier curves, and quadratic curves. Additionally, it contains some purely mathematical algorithms like IEEEremainder (also known as IEEE-754 remainder).".freeze
+  s.date = "2021-12-22"
+  s.description = "Perfect Shape is a collection of pure Ruby geometric algorithms that are mostly useful for GUI manipulation like checking containment of a mouse click point in popular geometry shapes such as rectangle, square, arc (open, chord, and pie), ellipse, circle, polygon, polyline, polyquad, polycubic, and paths containing lines, quadratic b\u00E9zier curves, and cubic b\u00E9zier curves (including both Ray Casting Algorithm, aka Even-odd Rule, and Winding Number Algorithm, aka Nonzero Rule). Additionally, it contains some purely mathematical algorithms like IEEEremainder (also known as IEEE-754 remainder).".freeze
   s.email = "andy.am@gmail.com".freeze
   s.extra_rdoc_files = [
     "CHANGELOG.md",
@@ -31,6 +31,7 @@ Gem::Specification.new do |s|
     "lib/perfect_shape/line.rb",
     "lib/perfect_shape/math.rb",
     "lib/perfect_shape/multi_point.rb",
+    "lib/perfect_shape/path.rb",
     "lib/perfect_shape/point.rb",
     "lib/perfect_shape/point_location.rb",
     "lib/perfect_shape/polygon.rb",

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: perfect-shape
 version: !ruby/object:Gem::Version
-  version: 0.0.11
+  version: 0.1.0
 platform: ruby
 authors:
 - Andy Maleh
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2021-12-20 00:00:00.000000000 Z
+date: 2021-12-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: equalizer
@@ -97,10 +97,11 @@ dependencies:
 description: Perfect Shape is a collection of pure Ruby geometric algorithms that
   are mostly useful for GUI manipulation like checking containment of a mouse click
   point in popular geometry shapes such as rectangle, square, arc (open, chord, and
-  pie), ellipse, circle, polygon (Ray Casting Algorithm aka Even-Odd Rule), polyline,
-  polyquad, polycubic, and paths containing lines, bezier curves, and quadratic curves.
-  Additionally, it contains some purely mathematical algorithms like IEEEremainder
-  (also known as IEEE-754 remainder).
+  pie), ellipse, circle, polygon, polyline, polyquad, polycubic, and paths containing
+  lines, quadratic bézier curves, and cubic bézier curves (including both Ray Casting
+  Algorithm, aka Even-odd Rule, and Winding Number Algorithm, aka Nonzero Rule). Additionally,
+  it contains some purely mathematical algorithms like IEEEremainder (also known as
+  IEEE-754 remainder).
 email: andy.am@gmail.com
 executables: []
 extensions: []
@@ -120,6 +121,7 @@ files:
 - lib/perfect_shape/line.rb
 - lib/perfect_shape/math.rb
 - lib/perfect_shape/multi_point.rb
+- lib/perfect_shape/path.rb
 - lib/perfect_shape/point.rb
 - lib/perfect_shape/point_location.rb
 - lib/perfect_shape/polygon.rb