perfect-shape 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8bb743eb7a0d935839d671a33b58a30ea8eb65b945ee20e6016690fd0c6864f8
-  data.tar.gz: cd5b26777efcf931ed81a84ec63fee3dcaed5dfa3b878dc39350e6eb206f937e
+  metadata.gz: a4eb7bc277a02c0795966623e05ee57514483d982bc0d80f264a525f6b3d5afa
+  data.tar.gz: f070a8292b835f6d2c68ff4ccddd3073b7a83d36e882d4e5c34c6e91a85d88ee
 SHA512:
-  metadata.gz: 7adf8c29ae005e8f22c15e460dcf99befd28acef67a5387d950bef1d94781be6fce9cb25b725092892da83a6821b5b59bc699cf5c581af11133d90b4946ed29b
-  data.tar.gz: 334ef034a6f1010f49ad2fa2edc9dfccae994d0f8524427104100b6f4ccc83a63b276f731d483c494625111ad5a668ac05300c9b589ae57b801645d393130c38
+  metadata.gz: 1add8519bdd16f38f8fb8431d8342c77df9f5d8d76f0dc6f1481bba5d9c0a15b653c56a9a0e372082f1590b55f5897ebac3f6a4d4505acd6ba017f257261e80d
+  data.tar.gz: fc3e2fce45f0a46ad7869fd5fec07d0dcf826e3bd36676439144eb3fd0198b8224d816a26db54858b43d0bb5332ff6b4108950efca3e71c1d5e42cebde4de63f

data/CHANGELOG.md

@@ -1,5 +1,12 @@
 # Change Log
 
+## 0.1.1
+
+- `PerfectShape::QuadraticBezierCurve` (two end points and one control point)
+- `PerfectShape::QuadraticBezierCurve#contain?(x_or_point, y=nil)`
+- `PerfectShape::QuadraticBezierCurve#==`
+- `PerfectShape::Path` having quadratic bezier curves in addition to points and lines
+
 ## 0.1.0
 
 - `PerfectShape::Path` (having points or lines)

data/README.md

@@ -1,9 +1,9 @@
-# Perfect Shape 0.1.0
+# Perfect Shape 0.1.1
 ## 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`](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)).
+[`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), and [paths](#perfectshapepath) containing [lines](#perfectshapeline), [quadratic bézier curves](#perfectshapequadraticbeziercurve), 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`](#perfectshapemath) contains some purely mathematical algorithms, like [IEEE 754-1985 Remainder](https://en.wikipedia.org/wiki/IEEE_754-1985).
 
@@ -14,13 +14,13 @@ To ensure high accuracy, this library does all its mathematical operations with
 Run:
 
 ```
-gem install perfect-shape -v 0.1.0
+gem install perfect-shape -v 0.1.1
 ```
 
 Or include in Bundler `Gemfile`:
 
 ```ruby
-gem 'perfect-shape', '~> 0.1.0'
+gem 'perfect-shape', '~> 0.1.1'
 ```
 
 And, run:
@@ -114,6 +114,12 @@ Points are simply represented by an `Array` of `[x,y]` coordinates when used wit
 - `#point_distance(x_or_point, y=nil)`: Returns the distance from a point to another point
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Point.new(x: 200, y: 150)
+```
+
 ### `PerfectShape::Line`
 
 Class
@@ -127,7 +133,7 @@ Includes `PerfectShape::MultiPoint`
 - `::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: [])`: constructs a line with two `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
@@ -142,6 +148,41 @@ Includes `PerfectShape::MultiPoint`
 - `#point_segment_distance(x_or_point, y=nil)`: Returns the distance from a point to a line segment.
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Line.new(points: [[200, 150], [270, 220]]) # start point and end point
+```
+
+### `PerfectShape::QuadraticBezierCurve`
+
+Class
+
+Extends `PerfectShape::Shape`
+
+Includes `PerfectShape::MultiPoint`
+
+![quadratic_bezier_curve](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/quadratic_bezier_curve.png)
+
+- `::new(points: [])`: constructs a quadratic bézier curve with three `points` (two end points and one control point) 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
+- `#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 (bounding box only guarantees that the shape is within it, but it might be bigger than the shape)
+- `#contain?(x_or_point, y=nil)`: checks if point is inside
+- `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
+
+Example:
+
+```ruby
+shape = PerfectShape::QuadraticBezierCurve.new(points: [[200, 150], [270, 220], [180, 170]]) # start point, control point, and end point
+```
+
 ### `PerfectShape::Rectangle`
 
 Class
@@ -167,6 +208,12 @@ Includes `PerfectShape::RectangularShape`
 - `#contain?(x_or_point, y=nil)`: checks if point is inside
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Rectangle.new(x: 15, y: 30, width: 200, height: 100)
+```
+
 ### `PerfectShape::Square`
 
 Class
@@ -191,6 +238,12 @@ Extends `PerfectShape::Rectangle`
 - `#contain?(x_or_point, y=nil)`: checks if point is inside
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Square.new(x: 15, y: 30, length: 200)
+```
+
 ### `PerfectShape::Arc`
 
 Class
@@ -225,6 +278,13 @@ Open Arc | Chord Arc | Pie Arc
 - `#contain?(x_or_point, y=nil)`: checks if point is inside
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Arc.new(type: :chord, x: 2, y: 3, width: 50, height: 60, start: 30, extent: 90)
+shape2 = PerfectShape::Arc.new(type: :chord, center_x: 2 + 25, center_y: 3 + 30, radius_x: 25, radius_y: 30, start: 30, extent: 90)
+```
+
 ### `PerfectShape::Ellipse`
 
 Class
@@ -253,6 +313,13 @@ Extends `PerfectShape::Arc`
 - `#contain?(x_or_point, y=nil)`: checks if point is inside
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Ellipse.new(x: 2, y: 3, width: 50, height: 60)
+shape2 = PerfectShape::Ellipse.new(center_x: 27, center_y: 33, radius_x: 25, radius_y: 30)
+```
+
 ### `PerfectShape::Circle`
 
 Class
@@ -283,6 +350,13 @@ Extends `PerfectShape::Ellipse`
 - `#contain?(x_or_point, y=nil)`: checks if point is inside
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 
+Example:
+
+```ruby
+shape = PerfectShape::Circle.new(x: 2, y: 3, diameter: 60)
+shape2 = PerfectShape::Circle.new(center_x: 2 + 30, center_y: 3 + 30, radius: 30)
+```
+
 ### `PerfectShape::Polygon`
 
 Class
@@ -291,9 +365,11 @@ Extends `PerfectShape::Shape`
 
 Includes `PerfectShape::MultiPoint`
 
+A polygon can be thought of as a special case of [path](#perfectshapepath) that is closed, has the [Even-Odd](https://en.wikipedia.org/wiki/Even%E2%80%93odd_rule) winding rule, and consists of lines only.
+
 ![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: [])`: 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
@@ -306,6 +382,12 @@ Includes `PerfectShape::MultiPoint`
 - `#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
 
+Example:
+
+```ruby
+shape = PerfectShape::Polygon.new(points: [[200, 150], [270, 170], [250, 220], [220, 190], [200, 200], [180, 170]])
+```
+
 ### `PerfectShape::Path`
 
 Class
@@ -316,8 +398,8 @@ 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
+- `::new(shapes: [], 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), `PerfectShape::Line`, or `PerfectShape::QuadraticBezierCurve`. 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 (must always start with `PerfectShape::Point` or Array of [x,y] coordinates representing start point)
 - `#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
@@ -329,11 +411,22 @@ Includes `PerfectShape::MultiPoint`
 - `#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
+- `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape (bounding box only guarantees that the shape is within it, but it might be bigger than the 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
 
+Example:
+
+```ruby
+path_shapes = []
+path_shapes << PerfectShape::Point.new(x: 200, y: 150)
+path_shapes << PerfectShape::Line.new(points: [250, 170]) # no need for start point, just end point
+path_shapes << PerfectShape::QuadraticBezierCurve.new(points: [[300, 185], [350, 150]]) # no need for start point, just control point and end point
+
+shape = PerfectShape::Path.new(shapes: path_shapes, closed: false, winding_rule: :wind_even_odd)
+```
+
 ## Process
 
 [Glimmer Process](https://github.com/AndyObtiva/glimmer/blob/master/PROCESS.md)

data/VERSION

@@ -1 +1 @@
-0.1.0
+0.1.1

data/lib/perfect_shape/line.rb

@@ -189,14 +189,14 @@ module PerfectShape
       # +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)
+        return BigDecimal('0') if (py <  y1 && py <  y2)
+        return BigDecimal('0') if (py >= y1 && py >= y2)
         # assert(y1 != y2);
-        return 0 if (px >= x1 && px >= x2)
+        return BigDecimal('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
+        return BigDecimal('0') if (px >= xintercept)
+        (y1 < y2) ? BigDecimal('1') : BigDecimal('-1')
       end
     end
     

data/lib/perfect_shape/multi_point.rb

@@ -26,8 +26,8 @@ module PerfectShape
   module MultiPoint
     attr_reader :points
     
-    def initialize(points: nil)
-      self.points = points || []
+    def initialize(points: [])
+      self.points = points
     end
     
     # Sets points, normalizing to an Array of Arrays of (x,y) pairs as BigDecimal

data/lib/perfect_shape/path.rb

@@ -22,6 +22,7 @@
 require 'perfect_shape/shape'
 require 'perfect_shape/point'
 require 'perfect_shape/line'
+require 'perfect_shape/quadratic_bezier_curve'
 require 'perfect_shape/multi_point'
 
 module PerfectShape
@@ -47,20 +48,24 @@ module PerfectShape
     end
     
     def points
-      @shapes.map do |shape|
+      the_points = []
+      @shapes.each do |shape|
         case shape
         when Point
-          shape.to_a
+          the_points << shape.to_a
         when Array
-          shape
+          the_points << shape.map {|n| BigDecimal(n.to_s)}
         when Line
-          shape.points.last.to_a
-#         when QuadraticBezierCurve # TODO
+          the_points << shape.points.last.to_a
+        when QuadraticBezierCurve
+          shape.points.each do |point|
+            the_points << point.to_a
+          end
 #         when CubicBezierCurve # TODO
         end
-      end.tap do |the_points|
-        the_points << @shapes.first.to_a if closed?
       end
+      the_points << @shapes.first.to_a if closed?
+      the_points
     end
     
     def points=(some_points)
@@ -76,7 +81,8 @@ module PerfectShape
           :move_to
         when Line
           :line_to
-#         when QuadraticBezierCurve # TODO
+        when QuadraticBezierCurve
+          :quad_to
 #         when CubicBezierCurve # TODO
         end
       end
@@ -107,7 +113,7 @@ module PerfectShape
         # 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
+        (point_crossings(x, y).to_i & mask) != 0
       else
         # Either x or y was infinite or NaN.
         # A NaN always produces a negative response to any test
@@ -131,13 +137,13 @@ module PerfectShape
     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
+      return BigDecimal('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
+      crossings = BigDecimal('0')
+      ci = BigDecimal('2')
       1.upto(shapes.count - 1).each do |i|
           case drawing_types[i]
           when :move_to
@@ -158,17 +164,19 @@ module PerfectShape
             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 :quad_to
+            quad_ctrlx = coords[ci]
+            ci += 1
+            quad_ctrly = coords[ci]
+            ci += 1
+            endx = coords[ci]
+            ci += 1
+            endy = coords[ci]
+            ci += 1
+            quad = PerfectShape::QuadraticBezierCurve.new(points: [[curx, cury], [quad_ctrlx, quad_ctrly], [endx, endy]])
+            crossings += quad.point_crossings(x, y, 0)
+            curx = endx;
+            cury = endy;
 #           when :cubic_to # TODO
 #             crossings +=
 #                 Curve.point_crossings_for_cubic(x, y,

data/lib/perfect_shape/quadratic_bezier_curve.rb

@@ -0,0 +1,182 @@
+# 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/multi_point'
+
+module PerfectShape
+  # Mostly ported from java.awt.geom: https://docs.oracle.com/javase/8/docs/api/java/awt/geom/QuadCurve2D.html
+  class QuadraticBezierCurve < Shape
+    class << self
+      def point_crossings(x1, y1, xc, yc, x2, y2, px, py, level = 0)
+        return BigDecimal('0') if (py <  y1 && py <  yc && py <  y2)
+        return BigDecimal('0') if (py >= y1 && py >= yc && py >= y2)
+        # Note y1 could equal y2...
+        return BigDecimal('0') if (px >= x1 && px >= xc && px >= x2)
+        if (px <  x1 && px <  xc && px <  x2)
+          if (py >= y1)
+            return BigDecimal('1') if (py < y2)
+          else
+            # py < y1
+            return BigDecimal('-1') if (py >= y2)
+          end
+          # py outside of y11 range, and/or y1==y2
+          return BigDecimal('0')
+        end
+        # double precision only has 52 bits of mantissa
+        return PerfectShape::Line.point_crossings(x1, y1, x2, y2, px, py) if (level > 52)
+        x1c = (x1 + xc) / BigDecimal('2')
+        y1c = (y1 + yc) / BigDecimal('2')
+        xc1 = (xc + x2) / BigDecimal('2')
+        yc1 = (yc + y2) / BigDecimal('2')
+        xc = (x1c + xc1) / BigDecimal('2')
+        yc = (y1c + yc1) / BigDecimal('2')
+        # [xy]c are NaN if any of [xy]0c or [xy]c1 are NaN
+        # [xy]0c or [xy]c1 are NaN if any of [xy][0c1] are NaN
+        # These values are also NaN if opposing infinities are added
+        return BigDecimal('0') if (xc.nan? || yc.nan?)
+        point_crossings(x1, y1, x1c, y1c, xc, yc, px, py, level+1) +
+          point_crossings(xc, yc, xc1, yc1, x2, y2, px, py, level+1);
+      end
+    end
+    
+    include MultiPoint
+    include Equalizer.new(:points)
+    
+    # Checks if quadratic bézier curve contains point (two-number Array or x, y args)
+    #
+    # @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 quadratic bézier curve, {@code false} if the point lies outside of the
+    # quadratic bézier curve's bounds.
+    def contain?(x_or_point, y = nil, distance: 0)
+      x, y = normalize_point(x_or_point, y)
+      return unless x && y
+
+      x1 = points[0][0]
+      y1 = points[0][1]
+      xc = points[1][0]
+      yc = points[1][1]
+      x2 = points[2][0]
+      y2 = points[2][1]
+
+      # We have a convex shape bounded by quad curve Pc(t)
+      # and ine Pl(t).
+      #
+      #     P1 = (x1, y1) - start point of curve
+      #     P2 = (x2, y2) - end point of curve
+      #     Pc = (xc, yc) - control point
+      #
+      #     Pq(t) = P1*(1 - t)^2 + 2*Pc*t*(1 - t) + P2*t^2 =
+      #           = (P1 - 2*Pc + P2)*t^2 + 2*(Pc - P1)*t + P1
+      #     Pl(t) = P1*(1 - t) + P2*t
+      #     t = [0:1]
+      #
+      #     P = (x, y) - point of interest
+      #
+      # Let's look at second derivative of quad curve equation:
+      #
+      #     Pq''(t) = 2 * (P1 - 2 * Pc + P2) = Pq''
+      #     It's constant vector.
+      #
+      # Let's draw a line through P to be parallel to this
+      # vector and find the intersection of the quad curve
+      # and the line.
+      #
+      # Pq(t) is point of intersection if system of equations
+      # below has the solution.
+      #
+      #     L(s) = P + Pq''*s == Pq(t)
+      #     Pq''*s + (P - Pq(t)) == 0
+      #
+      #     | xq''*s + (x - xq(t)) == 0
+      #     | yq''*s + (y - yq(t)) == 0
+      #
+      # This system has the solution if rank of its matrix equals to 1.
+      # That is, determinant of the matrix should be zero.
+      #
+      #     (y - yq(t))*xq'' == (x - xq(t))*yq''
+      #
+      # Let's solve this equation with 't' variable.
+      # Also let kx = x1 - 2*xc + x2
+      #          ky = y1 - 2*yc + y2
+      #
+      #     t0q = (1/2)*((x - x1)*ky - (y - y1)*kx) /
+      #                 ((xc - x1)*ky - (yc - y1)*kx)
+      #
+      # Let's do the same for our line Pl(t):
+      #
+      #     t0l = ((x - x1)*ky - (y - y1)*kx) /
+      #           ((x2 - x1)*ky - (y2 - y1)*kx)
+      #
+      # It's easy to check that t0q == t0l. This fact means
+      # we can compute t0 only one time.
+      #
+      # In case t0 < 0 or t0 > 1, we have an intersections outside
+      # of shape bounds. So, P is definitely out of shape.
+      #
+      # In case t0 is inside [0:1], we should calculate Pq(t0)
+      # and Pl(t0). We have three points for now, and all of them
+      # lie on one line. So, we just need to detect, is our point
+      # of interest between points of intersections or not.
+      #
+      # If the denominator in the t0q and t0l equations is
+      # zero, then the points must be collinear and so the
+      # curve is degenerate and encloses no area.  Thus the
+      # result is false.
+      kx = x1 - 2 * xc + x2;
+      ky = y1 - 2 * yc + y2;
+      dx = x - x1;
+      dy = y - y1;
+      dxl = x2 - x1;
+      dyl = y2 - y1;
+
+      t0 = (dx * ky - dy * kx) / (dxl * ky - dyl * kx)
+      return false if (t0 < 0 || t0 > 1 || t0 != t0)
+
+      xb = kx * t0 * t0 + 2 * (xc - x1) * t0 + x1;
+      yb = ky * t0 * t0 + 2 * (yc - y1) * t0 + y1;
+      xl = dxl * t0 + x1;
+      yl = dyl * t0 + y1;
+
+      (x >= xb && x < xl) ||
+        (x >= xl && x < xb) ||
+        (y >= yb && y < yl) ||
+        (y >= yl && y < yb)
+    end
+    
+    # Calculates the number of times the quad
+    # crosses the ray extending to the right from (x,y).
+    # If the point lies on a part of the curve,
+    # then no crossings are counted for that intersection.
+    # the level parameter should be 0 at the top-level call and will count
+    # up for each recursion level to prevent infinite recursion
+    # +1 is added for each crossing where the Y coordinate is increasing
+    # -1 is added for each crossing where the Y coordinate is decreasing
+    def point_crossings(x_or_point, y = nil, level = 0)
+      x, y = normalize_point(x_or_point, y)
+      return unless x && y
+      QuadraticBezierCurve.point_crossings(points[0][0], points[0][1], points[1][0], points[1][1], points[2][0], points[2][1], x, y, level)
+    end
+  end
+end

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.1.0 ruby lib
+# stub: perfect-shape 0.1.1 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "perfect-shape".freeze
-  s.version = "0.1.0"
+  s.version = "0.1.1"
 
   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-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.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, 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",
@@ -35,6 +35,7 @@ Gem::Specification.new do |s|
     "lib/perfect_shape/point.rb",
     "lib/perfect_shape/point_location.rb",
     "lib/perfect_shape/polygon.rb",
+    "lib/perfect_shape/quadratic_bezier_curve.rb",
     "lib/perfect_shape/rectangle.rb",
     "lib/perfect_shape/rectangular_shape.rb",
     "lib/perfect_shape/shape.rb",

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: perfect-shape
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Andy Maleh
@@ -97,11 +97,10 @@ 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, 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).
+  pie), ellipse, circle, polygon, 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: []
@@ -125,6 +124,7 @@ files:
 - lib/perfect_shape/point.rb
 - lib/perfect_shape/point_location.rb
 - lib/perfect_shape/polygon.rb
+- lib/perfect_shape/quadratic_bezier_curve.rb
 - lib/perfect_shape/rectangle.rb
 - lib/perfect_shape/rectangular_shape.rb
 - lib/perfect_shape/shape.rb