perfect-shape 0.5.1 → 0.5.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 11b0b3324d2d9a6ea74cf92529f4657899021ef9b515e9bac45ce0538927b519
-  data.tar.gz: b89aaf29076f074800f8934e3df56111254f5f162c5efbcd26ee1afda5386734
+  metadata.gz: f32696a2e0ecd7c1aceb16d9211b38e977b4dd15c7ba57acb8ac99a769d75036
+  data.tar.gz: 50c458cfcf134ce86bc11e0b22f1650b2faf2146c79c288d7b2501a2d7d9264c
 SHA512:
-  metadata.gz: bb359cd9182b49f0d345c66d17a3cfda427a9b366b615d8bd8b63fcf75953747da9273802295135fec146ad25bb0eb6875d83626224acdf159111d23ab61213b
-  data.tar.gz: a2c318a07294e002af53c80421f388f662045f390ec9be24437eb9c7aeeafb9af50db36899fbb90e738b67e1a21a85cb0762b238891fb2b93ce238893c5514c6
+  metadata.gz: 1e15378328df2eaad3769ce087118f7990fcb834963cbc56b738ea1cc292a92df0f86d77506e1a2f94985bc03211b5436b9965e8b6b5c97c80f9d7ad59f6cb20
+  data.tar.gz: cb64f0b3951ca4628f96e265070a88684060be6ffa38b5a45deea611bce0b2d20b72e43ef6c5d70b969925a31fe0017f4ec84407927f23a1b7824e0352bc9732

data/CHANGELOG.md

@@ -1,13 +1,42 @@
 # Change Log
 
+## 0.5.5
+
+- `PerfectShape::Arc#intersect?(rectangle)`
+- `PerfectShape::Ellipse#intersect?(rectangle)`
+- `PerfectShape::Circle#intersect?(rectangle)`
+
+## 0.5.4
+
+- `PerfectShape::Rectangle#intersect?(rectangle)`
+- `PerfectShape::Square#intersect?(rectangle)`
+- `PerfectShape::Rectangle#empty?`
+- `PerfectShape::Square#empty?`
+- `PerfectShape::Square#size`/`PerfectShape::Square#size=` aliases for `#length`/`#length=`
+
+## 0.5.3
+
+- `PerfectShape::CubicBezierCurve#intersect?(rectangle)`
+- `PerfectShape::CubicBezierCurve#rectangle_crossings(rectangle)`
+- `PerfectShape::CubicBezierCurve#rect_crossings(rxmin, rymin, rxmax, rymax, level, crossings = 0)`
+- `PerfectShape::Line#rect_crossings(rxmin, rymin, rxmax, rymax, crossings = 0)`
+
+## 0.5.2
+
+- `PerfectShape::QuadraticBezierCurve#intersect?(rectangle)`
+- `PerfectShape::QuadraticBezierCurve::tag(coord, low, high)`
+- `PerfectShape::QuadraticBezierCurve::eqn(val, c1, cp, c2)`
+- `PerfectShape::QuadraticBezierCurve::solve_quadratic(eqn)`
+- `PerfectShape::QuadraticBezierCurve::eval_quadratic(vals, num, include0, include1, inflect, c1, ctrl, c2)`
+
 ## 0.5.1
 
-- `Point#intersect?(rectangle)` (equivalent to `Rectangle#contain?(point)`)
+- `PerfectShape::Point#intersect?(rectangle)` (equivalent to `PerfectShape::Rectangle#contain?(point)`)
 
 ## 0.5.0
 
-- `Line#intersect?(rectangle)`
-- `Rectangle#out_state(x_or_point, y = nil)`
+- `PerfectShape::Line#intersect?(rectangle)`
+- `PerfectShape::Rectangle#out_state(x_or_point, y = nil)`
 
 ## 0.4.0
 

data/README.md

@@ -1,4 +1,4 @@
-# Perfect Shape 0.5.1
+# Perfect Shape 0.5.5
 ## 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)
@@ -14,13 +14,13 @@ To ensure high accuracy, this library does all its mathematical operations with
 Run:
 
 ```
-gem install perfect-shape -v 0.5.1
+gem install perfect-shape -v 0.5.5
 ```
 
 Or include in Bundler `Gemfile`:
 
 ```ruby
-gem 'perfect-shape', '~> 0.5.1'
+gem 'perfect-shape', '~> 0.5.5'
 ```
 
 And, run:
@@ -224,6 +224,7 @@ Includes `PerfectShape::MultiPoint`
 - `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 - `#relative_counterclockwise(x_or_point, y=nil)`: 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, 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_distance(x_or_point, y=nil)`: Returns the distance from a point to a line segment.
+- `#rect_crossings(rxmin, rymin, rxmax, rymax, crossings = 0)`: rectangle crossings (adds to crossings arg)
 
 Example:
 
@@ -250,6 +251,10 @@ Includes `PerfectShape::MultiPoint`
 
 ![quadratic_bezier_curve](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/quadratic_bezier_curve.png)
 
+- `::tag(coord, low, high)`: Determine where coord lies with respect to the range from low to high.  It is assumed that low < high.  The return value is one of the 5 values BELOW, LOWEDGE, INSIDE, HIGHEDGE, or ABOVE.
+- `::eqn(val, c1, cp, c2)`: Fill an array with the coefficients of the parametric equation in t, ready for solving against val with solve_quadratic. We currently have: val = Py(t) = C1*(1-t)^2 + 2*CP*t*(1-t) + C2*t^2 = C1 - 2*C1*t + C1*t^2 + 2*CP*t - 2*CP*t^2 + C2*t^2 = C1 + (2*CP - 2*C1)*t + (C1 - 2*CP + C2)*t^2; 0 = (C1 - val) + (2*CP - 2*C1)*t + (C1 - 2*CP + C2)*t^2; 0 = C + Bt + At^2; C = C1 - val; B = 2*CP - 2*C1; A = C1 - 2*CP + C2
+- `::solve_quadratic(eqn)`: Solves the quadratic whose coefficients are in the eqn array and places the non-complex roots into the res array, returning the number of roots. The quadratic solved is represented by the equation: <pre>eqn = {C, B, A}; ax^2 + bx + c = 0</pre> A return value of `-1` is used to distinguish a constant equation, which might be always 0 or never 0, from an equation that has no zeroes.
+- `::eval_quadratic(vals, num, include0, include1, inflect, c1, ctrl, c2)`: Evaluate the t values in the first num slots of the vals[] array and place the evaluated values back into the same array.  Only evaluate t values that are within the range <, >, including the 0 and 1 ends of the range iff the include0 or include1 booleans are true.  If an "inflection" equation is handed in, then any points which represent a point of inflection for that quadratic equation are also ignored.
 - `::new(points: [])`: constructs a quadratic bézier curve with three `points` (start point, control point, and end point) as `Array` of `Array`s of `[x,y]` pairs or flattened `Array` of alternating x and y coordinates
 - `#points`: points (start point, control point, and end point)
 - `#min_x`: min x
@@ -264,6 +269,7 @@ Includes `PerfectShape::MultiPoint`
 - `#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)
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select a quadratic bezier curve shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 - `#curve_center_point`: point at the center of the curve outline (not the center of the bounding box area like `center_x` and `center_y`)
 - `#curve_center_x`: point x coordinate at the center of the curve outline (not the center of the bounding box area like `center_x` and `center_y`)
 - `#curve_center_y`: point y coordinate at the center of the curve outline (not the center of the bounding box area like `center_x` and `center_y`)
@@ -313,11 +319,14 @@ Includes `PerfectShape::MultiPoint`
 - `#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)
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select a cubic bezier curve shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 - `#curve_center_point`: point at the center of the curve outline (not the center of the bounding box area like `center_x` and `center_y`)
 - `#curve_center_x`: point x coordinate at the center of the curve outline (not the center of the bounding box area like `center_x` and `center_y`)
 - `#curve_center_y`: point y coordinate at the center of the curve outline (not the center of the bounding box area like `center_x` and `center_y`)
 - `#subdivisions(level=1)`: subdivides cubic bezier curve at its center into into 2 cubic bezier curves by default, or more if `level` of recursion is specified. The resulting number of subdivisions is `2` to the power of `level`.
 - `#point_distance(x_or_point, y=nil, minimum_distance_threshold: OUTLINE_MINIMUM_DISTANCE_THRESHOLD)`: calculates distance from point to curve segment. It does so by subdividing curve into smaller curves and checking against the curve center points until the distance is less than `minimum_distance_threshold`, to avoid being an overly costly operation.
+- `#rectangle_crossings(rectangle)`: rectangle crossings (used to determine rectangle interior intersection), optimized to check if line represented by cubic bezier curve crosses the rectangle first, and if not then perform expensive check with `#rect_crossings`
+- `#rect_crossings(rxmin, rymin, rxmax, rymax, level, crossings = 0)`: rectangle crossings (adds to crossings arg)
 
 Example:
 
@@ -363,8 +372,10 @@ Includes `PerfectShape::RectangularShape`
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select a rectangle shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 - `#edges`: edges of rectangle as `PerfectShape::Line` objects
 - `#out_state(x_or_point, y = nil)`: Returns "out state" of specified point (x,y) (whether it lies to the left, right, top, bottom of rectangle). If point is outside rectangle, it returns a bit mask combination of `Rectangle::OUT_LEFT`, `Rectangle::OUT_RIGHT`, `Rectangle::OUT_TOP`, or `Rectangle::OUT_BOTTOM`. Otherwise, it returns `0` if point is inside the rectangle.
+- `#empty?`: Returns `true` if width or height are 0 (or negative) and `false` otherwise
 
 Example:
 
@@ -393,7 +404,7 @@ Extends `PerfectShape::Rectangle`
 
 ![square](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/square.png)
 
-- `::new(x: 0, y: 0, length: 1)`: constructs a square
+- `::new(x: 0, y: 0, length: 1)` (`length` alias: `size`): constructs a square
 - `#x`: top-left x
 - `#y`: top-left y
 - `#length`: length
@@ -409,7 +420,9 @@ Extends `PerfectShape::Rectangle`
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select a square shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 - `#edges`: edges of square as `PerfectShape::Line` objects
+- `#empty?`: Returns `true` if length is 0 (or negative) and `false` otherwise
 
 Example:
 
@@ -464,6 +477,8 @@ Open Arc | Chord Arc | Pie Arc
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select an arc shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
+- `#contain_angle?(angle)`: returns `true` if the angle is within the angular extents of the arc and `false` otherwise
 
 Example:
 
@@ -587,6 +602,7 @@ Extends `PerfectShape::Arc`
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select an ellipse shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 
 Example:
 
@@ -648,6 +664,7 @@ Extends `PerfectShape::Ellipse`
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
 - `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
 - `#contain?(x_or_point, y=nil, outline: false, distance_tolerance: 0)`: checks if point is inside when `outline` is `false` or if point is on the outline when `outline` is `true`. `distance_tolerance` can be used as a fuzz factor when `outline` is `true`, for example, to help GUI users mouse-click-select a circle shape from its outline more successfully
+- `#intersect?(rectangle)`: Returns `true` if intersecting with interior of rectangle or `false` otherwise. This is useful for GUI optimization checks of whether a shape appears in a GUI viewport rectangle and needs redrawing
 
 Example:
 

data/VERSION

@@ -1 +1 @@
-0.5.1
+0.5.5

data/lib/perfect_shape/arc.rb

@@ -141,8 +141,8 @@ module PerfectShape
     # @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 arc, {@code false} if the point lies outside of the
+    # @return true if the point lies within the bound of
+    # the arc, false if the point lies outside of the
     # arc's bounds.
     def contain?(x_or_point, y = nil, outline: false, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)
@@ -212,5 +212,105 @@ module PerfectShape
 
       (angle >= 0.0) && (angle < ang_ext)
     end
+    
+    def intersect?(rectangle)
+      x = rectangle.x
+      y = rectangle.y
+      w = rectangle.width
+      h = rectangle.height
+      aw = self.width
+      ah = self.height
+
+      return false if w <= 0 || h <= 0 || aw <= 0 || ah <= 0
+      ext = self.extent
+      return false if ext == 0
+
+      ax  = self.x
+      ay  = self.y
+      axw = ax + aw
+      ayh = ay + ah
+      xw  = x + w
+      yh  = y + h
+
+      # check bbox
+      return false if x >= axw || y >= ayh || xw <= ax || yh <= ay
+
+      # extract necessary data
+      axc = self.center_x
+      ayc = self.center_y
+      sx, sy = self.start_point
+      ex, ey = self.end_point
+
+      # Try to catch rectangles that intersect arc in areas
+      # outside of rectagle with left top corner coordinates
+      # (min(center x, start point x, end point x),
+      #  min(center y, start point y, end point y))
+      # and rigth bottom corner coordinates
+      # (max(center x, start point x, end point x),
+      #  max(center y, start point y, end point y)).
+      # So we'll check axis segments outside of rectangle above.
+      if ayc >= y && ayc <= yh # 0 and 180
+        return true if (sx < xw && ex < xw && axc < xw &&
+             axw > x && contain_angle?(0)) ||
+            (sx > x && ex > x && axc > x &&
+             ax < xw && contain_angle?(180))
+      end
+      if axc >= x && axc <= xw # 90 and 270
+        return true if (sy > y && ey > y && ayc > y &&
+             ay < yh && contain_angle?(90)) ||
+            (sy < yh && ey < yh && ayc < yh &&
+             ayh > y && contain_angle?(270))
+      end
+
+      # For PIE we should check intersection with pie slices
+      # also we should do the same for arcs with extent is greater
+      # than 180, because we should cover case of rectangle, which
+      # situated between center of arc and chord, but does not
+      # intersect the chord.
+      rect = PerfectShape::Rectangle.new(x: x, y: y, width: w, height: h)
+      if type == :pie || ext.abs > 180
+        # for PIE: try to find intersections with pie slices
+        line1 = PerfectShape::Line.new(points: [[axc, ayc], [sx, sy]])
+        line2 = PerfectShape::Line.new(points: [[axc, ayc], [ex, ey]])
+        return true if line1.intersect?(rect) || line2.intersect?(rect)
+      else
+        # for CHORD and OPEN: try to find intersections with chord
+        line = PerfectShape::Line.new(points: [[sx, sy], [ex, ey]])
+        return true if line.intersect?(rect)
+      end
+
+      # finally check the rectangle corners inside the arc
+      return true if contain?(x, y) || contain?(x + w, y) ||
+                     contain?(x, y + h) || contain?(x + w, y + h)
+
+      false
+    end
+    
+    # Returns the starting point of the arc.  This point is the
+    # intersection of the ray from the center defined by the
+    # starting angle and the elliptical boundary of the arc.
+    #
+    # @return An (x,y) pair Array object representing the
+    # x,y coordinates of the starting point of the arc.
+    def start_point
+      angle = Math.degrees_to_radians(-self.start)
+      x = self.x + (Math.cos(angle) * 0.5 + 0.5) * self.width
+      y = self.y + (Math.sin(angle) * 0.5 + 0.5) * self.height
+      [x, y]
+    end
+
+    # Returns the ending point of the arc.  This point is the
+    # intersection of the ray from the center defined by the
+    # starting angle plus the angular extent of the arc and the
+    # elliptical boundary of the arc.
+    #
+    # @return An (x,y) pair Array object representing the
+    # x,y coordinates  of the ending point of the arc.
+    def end_point
+      angle = Math.degrees_to_radians(-self.start - self.extent)
+      x = self.x + (Math.cos(angle) * 0.5 + 0.5) * self.width
+      y = self.y + (Math.sin(angle) * 0.5 + 0.5) * self.height
+      [x, y]
+    end
   end
 end

data/lib/perfect_shape/cubic_bezier_curve.rb

@@ -82,8 +82,8 @@ module PerfectShape
     # @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 cubic bézier curve, {@code false} if the point lies outside of the
+    # @return true if the point lies within the bound of
+    # the cubic bézier curve, false if the point lies outside of the
     # cubic bézier curve's bounds.
     def contain?(x_or_point, y = nil, outline: false, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)
@@ -211,5 +211,118 @@ module PerfectShape
         last_minimum_distance
       end
     end
+    
+    def intersect?(rectangle)
+      x = rectangle.x
+      y = rectangle.y
+      w = rectangle.width
+      h = rectangle.height
+      
+      # Trivially reject non-existant rectangles
+      return false if w <= 0 || h <= 0
+
+      num_crossings = rectangle_crossings(rectangle)
+      # the intended return value is
+      # num_crossings != 0 || num_crossings == Rectangle::RECT_INTERSECTS
+      # but if (num_crossings != 0) num_crossings == INTERSECTS won't matter
+      # and if !(num_crossings != 0) then num_crossings == 0, so
+      # num_crossings != RECT_INTERSECT
+      num_crossings != 0
+    end
+    
+    def rectangle_crossings(rectangle)
+      x = rectangle.x
+      y = rectangle.y
+      w = rectangle.width
+      h = rectangle.height
+      x1 = points[0][0]
+      y1 = points[0][1]
+      x2 = points[3][0]
+      y2 = points[3][1]
+    
+      crossings = 0
+      if !(x1 == x2 && y1 == y2)
+        line = PerfectShape::Line.new(points: [[x1, y1], [x2, y2]])
+        crossings = line.rect_crossings(x, y, x+w, y+h, crossings)
+        return crossings if crossings == Rectangle::RECT_INTERSECTS
+      end
+      # we call this with the curve's direction reversed, because we wanted
+      # to call rectCrossingsForLine first, because it's cheaper.
+      rect_crossings(x, y, x+w, y+h, 0, crossings)
+    end
+    
+    # Accumulate the number of times the cubic crosses the shadow
+    # extending to the right of the rectangle.  See the comment
+    # for the RECT_INTERSECTS constant for more complete details.
+    #
+    # crossings arg is the initial crossings value to add to (useful
+    # in cases where you want to accumulate crossings from multiple
+    # shapes)
+    def rect_crossings(rxmin, rymin, rxmax, rymax, level, crossings = 0)
+      x0 = points[0][0]
+      y0 = points[0][1]
+      xc0 = points[1][0]
+      yc0 = points[1][1]
+      xc1 = points[2][0]
+      yc1 = points[2][1]
+      x1 = points[3][0]
+      y1 = points[3][1]
+      
+      return crossings if y0 >= rymax && yc0 >= rymax && yc1 >= rymax && y1 >= rymax
+      return crossings if y0 <= rymin && yc0 <= rymin && yc1 <= rymin && y1 <= rymin
+      return crossings if x0 <= rxmin && xc0 <= rxmin && xc1 <= rxmin && x1 <= rxmin
+      if x0 >= rxmax && xc0 >= rxmax && xc1 >= rxmax && x1 >= rxmax
+        # Cubic is entirely to the right of the rect
+        # and the vertical range of the 4 Y coordinates of the cubic
+        # overlaps the vertical range of the rect by a non-empty amount
+        # We now judge the crossings solely based on the line segment
+        # connecting the endpoints of the cubic.
+        # Note that we may have 0, 1, or 2 crossings as the control
+        # points may be causing the Y range intersection while the
+        # two endpoints are entirely above or below.
+        if y0 < y1
+          # y-increasing line segment...
+          crossings += 1 if (y0 <= rymin && y1 >  rymin)
+          crossings += 1 if (y0 <  rymax && y1 >= rymax)
+        elsif y1 < y0
+          # y-decreasing line segment...
+          crossings -= 1 if (y1 <= rymin && y0 >  rymin)
+          crossings -= 1 if (y1 <  rymax && y0 >= rymax)
+        end
+        return crossings
+      end
+      # The intersection of ranges is more complicated
+      # First do trivial INTERSECTS rejection of the cases
+      # where one of the endpoints is inside the rectangle.
+      return Rectangle::RECT_INTERSECTS if ((x0 > rxmin && x0 < rxmax && y0 > rymin && y0 < rymax) ||
+        (x1 > rxmin && x1 < rxmax && y1 > rymin && y1 < rymax))
+          
+      # Otherwise, subdivide and look for one of the cases above.
+      # double precision only has 52 bits of mantissa
+      return PerfectShape::Line.new(points: [[x0, y0], [x1, y1]]).rect_crossings(rxmin, rymin, rxmax, rymax, crossings) if (level > 52)
+      xmid = BigDecimal((xc0 + xc1).to_s) / 2
+      ymid = BigDecimal((yc0 + yc1).to_s) / 2
+      xc0 = BigDecimal((x0 + xc0).to_s) / 2
+      yc0 = BigDecimal((y0 + yc0).to_s) / 2
+      xc1 = BigDecimal((xc1 + x1).to_s) / 2
+      yc1 = BigDecimal((yc1 + y1).to_s) / 2
+      xc0m = BigDecimal((xc0 + xmid).to_s) / 2
+      yc0m = BigDecimal((yc0 + ymid).to_s) / 2
+      xmc1 = BigDecimal((xmid + xc1).to_s) / 2
+      ymc1 = BigDecimal((ymid + yc1).to_s) / 2
+      xmid = BigDecimal((xc0m + xmc1).to_s) / 2
+      ymid = BigDecimal((yc0m + ymc1).to_s) / 2
+      # [xy]mid are NaN if any of [xy]c0m or [xy]mc1 are NaN
+      # [xy]c0m or [xy]mc1 are NaN if any of [xy][c][01] are NaN
+      # These values are also NaN if opposing infinities are added
+      return 0 if xmid.nan? || ymid.nan?
+      cubic1 = CubicBezierCurve.new(points: [[x0, y0], [xc0, yc0], [xc0m, yc0m], [xmid, ymid]])
+      crossings = cubic1.rect_crossings(rxmin, rymin, rxmax, rymax, level + 1, crossings)
+      if crossings != Rectangle::RECT_INTERSECTS
+        cubic2 = CubicBezierCurve.new(points: [[xmid, ymid], [xmc1, ymc1], [xc1, yc1], [x1, y1]])
+        crossings = cubic2.rect_crossings(rxmin, rymin, rxmax, rymax, level + 1, crossings)
+      end
+      crossings
+    end
   end
 end

data/lib/perfect_shape/ellipse.rb

@@ -59,8 +59,8 @@ module PerfectShape
     # @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 ellipse, {@code false} if the point lies outside of the
+    # @return true if the point lies within the bound of
+    # the ellipse, false if the point lies outside of the
     # ellipse's bounds.
     def contain?(x_or_point, y = nil, outline: false, distance_tolerance: 0)
       # This is implemented again even though super would have just worked to have an optimized algorithm for Ellipse.

data/lib/perfect_shape/line.rb

@@ -22,7 +22,6 @@
 require 'perfect_shape/shape'
 require 'perfect_shape/point'
 require 'perfect_shape/multi_point'
-require 'perfect_shape/rectangle'
 
 module PerfectShape
   class Line < Shape
@@ -55,11 +54,11 @@ module PerfectShape
       #                  coordinates with respect to the line segment formed
       #                  by the first two specified coordinates.
       def relative_counterclockwise(x1, y1, x2, y2, px, py)
-        x2 -= x1;
-        y2 -= y1;
-        px -= x1;
-        py -= y1;
-        ccw = px * y2 - py * x2;
+        x2 -= x1
+        y2 -= y1
+        px -= x1
+        py -= y1
+        ccw = px * y2 - py * x2
         if ccw == 0.0
           # The point is colinear, classify based on which side of
           # the segment the point falls on.  We can calculate a
@@ -67,7 +66,7 @@ module PerfectShape
           # segment - a negative value indicates the point projects
           # outside of the segment in the direction of the particular
           # endpoint used as the origin for the projection.
-          ccw = px * x2 + py * y2;
+          ccw = px * x2 + py * y2
           if ccw > 0.0
             # Reverse the projection to be relative to the original x2,y2
             # x2 and y2 are simply negated.
@@ -76,13 +75,13 @@ module PerfectShape
             # Since we really want to get a positive answer when the
             #    point is "beyond (x2,y2)", then we want to calculate
             #    the inverse anyway - thus we leave x2 & y2 negated.
-            px -= x2;
-            py -= y2;
-            ccw = px * x2 + py * y2;
+            px -= x2
+            py -= y2
+            ccw = px * x2 + py * y2
             ccw = 0.0 if ccw < 0.0
           end
         end
-        (ccw < 0.0) ? -1 : ((ccw > 0.0) ? 1 : 0);
+        (ccw < 0.0) ? -1 : ((ccw > 0.0) ? 1 : 0)
       end
       
       # Returns the square of the distance from a point to a line segment.
@@ -121,12 +120,12 @@ module PerfectShape
         # px,py becomes relative vector from x1,y1 to test point
         px -= x1
         py -= y1
-        dot_product = px * x2 + py * y2;
+        dot_product = px * x2 + py * y2
         if dot_product <= 0.0
           # px,py is on the side of x1,y1 away from x2,y2
           # distance to segment is length of px,py vector
           # "length of its (clipped) projection" is now 0.0
-          projected_length_square = BigDecimal('0.0');
+          projected_length_square = BigDecimal('0.0')
         else
           # switch to backwards vectors relative to x2,y2
           # x2,y2 are already the negative of x1,y1=>x2,y2
@@ -192,10 +191,10 @@ module PerfectShape
       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);
+        # 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);
+        xintercept = x1 + (py - y1) * (x2 - x1) / (y2 - y1)
         return 0 if (px >= xintercept)
         (y1 < y2) ? 1 : -1
       end
@@ -210,8 +209,8 @@ module PerfectShape
     # @param y The Y coordinate of the point to test.
     # @param distance_tolerance The distance from line to tolerate (0 by default)
     #
-    # @return {@code true} if the point lies within the bound of
-    # the line, {@code false} if the point lies outside of the
+    # @return true if the point lies within the bound of
+    # the line, false if the point lies outside of the
     # line's bounds.
     def contain?(x_or_point, y = nil, outline: true, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)
@@ -243,7 +242,80 @@ module PerfectShape
       Line.point_crossings(points[0][0], points[0][1], points[1][0], points[1][1], x, y)
     end
     
+    # Accumulate the number of times the line crosses the shadow
+    # extending to the right of the rectangle.  See the comment
+    # for the Rectangle::RECT_INTERSECTS constant for more complete details.
+    #
+    # crossings arg is the initial crossings value to add to (useful
+    # in cases where you want to accumulate crossings from multiple
+    # shapes)
+    def rect_crossings(rxmin, rymin, rxmax, rymax, crossings = 0)
+      x0 = points[0][0]
+      y0 = points[0][1]
+      x1 = points[1][0]
+      y1 = points[1][1]
+      return crossings if y0 >= rymax && y1 >= rymax
+      return crossings if y0 <= rymin && y1 <= rymin
+      return crossings if x0 <= rxmin && x1 <= rxmin
+      if x0 >= rxmax && x1 >= rxmax
+        # Line is entirely to the right of the rect
+        # and the vertical ranges of the two overlap by a non-empty amount
+        # Thus, this line segment is partially in the "right-shadow"
+        # Path may have done a complete crossing
+        # Or path may have entered or exited the right-shadow
+        if y0 < y1
+            # y-increasing line segment...
+            # We know that y0 < rymax and y1 > rymin
+            crossings += 1 if (y0 <= rymin)
+            crossings += 1 if (y1 >= rymax)
+        elsif y1 < y0
+            # y-decreasing line segment...
+            # We know that y1 < rymax and y0 > rymin
+            crossings -= 1 if (y1 <= rymin)
+            crossings -= 1 if (y0 >= rymax)
+        end
+        return crossings
+      end
+      # Remaining case:
+      # Both x and y ranges overlap by a non-empty amount
+      # First do trivial INTERSECTS rejection of the cases
+      # where one of the endpoints is inside the rectangle.
+      return Rectangle::RECT_INTERSECTS if ((x0 > rxmin && x0 < rxmax && y0 > rymin && y0 < rymax) ||
+        (x1 > rxmin && x1 < rxmax && y1 > rymin && y1 < rymax))
+      # Otherwise calculate the y intercepts and see where
+      # they fall with respect to the rectangle
+      xi0 = x0
+      if y0 < rymin
+        xi0 += ((rymin - y0) * (x1 - x0) / (y1 - y0))
+      elsif y0 > rymax
+        xi0 += ((rymax - y0) * (x1 - x0) / (y1 - y0))
+      end
+      xi1 = x1
+      if y1 < rymin
+        xi1 += ((rymin - y1) * (x0 - x1) / (y0 - y1))
+      elsif y1 > rymax
+        xi1 += ((rymax - y1) * (x0 - x1) / (y0 - y1))
+      end
+      return crossings if xi0 <= rxmin && xi1 <= rxmin
+      if xi0 >= rxmax && xi1 >= rxmax
+        if y0 < y1
+          # y-increasing line segment...
+          # We know that y0 < rymax and y1 > rymin
+          crossings += 1 if (y0 <= rymin)
+          crossings += 1 if (y1 >= rymax)
+        elsif y1 < y0
+          # y-decreasing line segment...
+          # We know that y1 < rymax and y0 > rymin
+          crossings -= 1 if (y1 <= rymin)
+          crossings -= 1 if (y0 >= rymax)
+        end
+        return crossings
+      end
+      Rectangle::RECT_INTERSECTS
+    end
+    
     def intersect?(rectangle)
+      require 'perfect_shape/rectangle'
       x1 = points[0][0]
       y1 = points[0][1]
       x2 = points[1][0]

data/lib/perfect_shape/point.rb

@@ -80,8 +80,8 @@ module PerfectShape
     # @param y The Y coordinate of the point to test.
     # @param distance_tolerance The distance from point to tolerate (0 by default)
     #
-    # @return {@code true} if the point is close enough within distance tolerance,
-    # {@code false} if the point is too far.
+    # @return true if the point is close enough within distance tolerance,
+    # false if the point is too far.
     def contain?(x_or_point, y = nil, outline: true, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)
       return unless x && y

data/lib/perfect_shape/polygon.rb

@@ -34,8 +34,8 @@ module PerfectShape
     # @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 polygon, {@code false} if the point lies outside of the
+    # @return true if the point lies within the bound of
+    # the polygon, false if the point lies outside of the
     # polygon's bounds.
     def contain?(x_or_point, y = nil, outline: false, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)

data/lib/perfect_shape/quadratic_bezier_curve.rb

@@ -62,13 +62,124 @@ module PerfectShape
         # These values are also NaN if opposing infinities are added
         return 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);
+          point_crossings(xc, yc, xc1, yc1, x2, y2, px, py, level+1)
+      end
+      
+      # Determine where coord lies with respect to the range from
+      # low to high.  It is assumed that low < high.  The return
+      # value is one of the 5 values BELOW, LOWEDGE, INSIDE, HIGHEDGE,
+      # or ABOVE.
+      def tag(coord, low, high)
+        return (coord < low ? BELOW : LOWEDGE) if coord <= low
+        return (coord > high ? ABOVE : HIGHEDGE) if coord >= high
+        INSIDE
+      end
+      
+      # Fill an array with the coefficients of the parametric equation
+      # in t, ready for solving against val with solve_quadratic.
+      # We currently have:
+      #     val = Py(t) = C1*(1-t)^2 + 2*CP*t*(1-t) + C2*t^2
+      #                 = C1 - 2*C1*t + C1*t^2 + 2*CP*t - 2*CP*t^2 + C2*t^2
+      #                 = C1 + (2*CP - 2*C1)*t + (C1 - 2*CP + C2)*t^2
+      #               0 = (C1 - val) + (2*CP - 2*C1)*t + (C1 - 2*CP + C2)*t^2
+      #               0 = C + Bt + At^2
+      #     C = C1 - val
+      #     B = 2*CP - 2*C1
+      #     A = C1 - 2*CP + C2
+      def eqn(val, c1, cp, c2)
+        [
+          c1 - val,
+          cp + cp - c1 - c1,
+          c1 - cp - cp + c2,
+        ]
+      end
+      
+      # Solves the quadratic whose coefficients are in the eqn
+      # array and places the non-complex roots into the res
+      # array, returning the number of roots.
+      # The quadratic solved is represented by the equation:
+      # <pre>
+      #     eqn = {C, B, A}
+      #     ax^2 + bx + c = 0
+      # </pre>
+      # A return value of -1 is used to distinguish a constant
+      # equation, which might be always 0 or never 0, from an equation that
+      # has no zeroes.
+      # @param eqn the specified array of coefficients to use to solve
+      #        the quadratic equation
+      # @param res the array that contains the non-complex roots
+      #        resulting from the solution of the quadratic equation
+      # @return the number of roots, or -1 if the equation is
+      #  a constant.
+      def solve_quadratic(eqn, res)
+        a = eqn[2]
+        b = eqn[1]
+        c = eqn[0]
+        roots = -1
+        if a == 0.0
+          #  The quadratic parabola has degenerated to a line.
+          #  The line has degenerated to a constant.
+          return -1 if b == 0.0
+          res[roots += 1] = -c / b
+        else
+          #  From Numerical Recipes, 5.6, Quadratic and Cubic Equations
+          d = b * b - 4.0 * a * c
+          #  If d < 0.0, then there are no roots
+          return 0 if d < 0.0
+          d = BigDecimal(Math.sqrt(d).to_a)
+          #  For accuracy, calculate one root using:
+          #      (-b +/- d) / 2a
+          #  and the other using:
+          #      2c / (-b +/- d)
+          #  Choose the sign of the +/- so that b+d gets larger in magnitude
+          d = -d if b < 0.0
+          q = (b + d) / -2.0
+          #  We already tested a for being 0 above
+          res[roots += 1] = q / a
+          res[roots += 1] = c / q if q != 0.0
+        end
+        roots
+      end
+      
+      # Evaluate the t values in the first num slots of the vals[] array
+      # and place the evaluated values back into the same array.  Only
+      # evaluate t values that are within the range <, >, including
+      # the 0 and 1 ends of the range iff the include0 or include1
+      # booleans are true.  If an "inflection" equation is handed in,
+      # then any points which represent a point of inflection for that
+      # quadratic equation are also ignored.
+      def eval_quadratic(vals, num,
+                                   include0,
+                                   include1,
+                                   inflect,
+                                   c1, ctrl, c2)
+        j = -1
+        i = 0
+        while i < num
+          t = vals[i]
+          
+          if ((include0 ? t >= 0 : t > 0) &&
+              (include1 ? t <= 1 : t < 1) &&
+              (inflect.nil? ||
+               inflect[1] + 2*inflect[2]*t != 0))
+            u = 1 - t
+            vals[j+=1] = c1*u*u + 2*ctrl*t*u + c2*t*t
+          end
+          i+=1
+        end
+        j
       end
     end
     
     include MultiPoint
     include Equalizer.new(:points)
     
+    BELOW = -2
+    LOWEDGE = -1
+    INSIDE = 0
+    HIGHEDGE = 1
+    ABOVE = 2
+    
     OUTLINE_MINIMUM_DISTANCE_THRESHOLD = BigDecimal('0.001')
     
     # Checks if quadratic bézier curve contains point (two-number Array or x, y args)
@@ -76,8 +187,8 @@ module PerfectShape
     # @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
+    # @return true if the point lies within the bound of
+    # the quadratic bézier curve, false if the point lies outside of the
     # quadratic bézier curve's bounds.
     def contain?(x_or_point, y = nil, outline: false, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)
@@ -159,20 +270,20 @@ module PerfectShape
         # 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;
+        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;
+        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) ||
@@ -273,5 +384,166 @@ module PerfectShape
         last_minimum_distance
       end
     end
+    
+    def intersect?(rectangle)
+      x = rectangle.x
+      y = rectangle.y
+      w = rectangle.width
+      h = rectangle.height
+      
+      # Trivially reject non-existant rectangles
+      return false if w <= 0 || h <= 0
+
+      # Trivially accept if either endpoint is inside the rectangle
+      # (not on its border since it may end there and not go inside)
+      # Record where they lie with respect to the rectangle.
+      #     -1 => left, 0 => inside, 1 => right
+      x1 = points[0][0]
+      y1 = points[0][1]
+      x1tag = QuadraticBezierCurve.tag(x1, x, x+w)
+      y1tag = QuadraticBezierCurve.tag(y1, y, y+h)
+      return true if x1tag == INSIDE && y1tag == INSIDE
+      x2 = points[2][0]
+      y2 = points[2][1]
+      x2tag = QuadraticBezierCurve.tag(x2, x, x+w)
+      y2tag = QuadraticBezierCurve.tag(y2, y, y+h)
+      return true if x2tag == INSIDE && y2tag == INSIDE
+      ctrlx = points[1][0]
+      ctrly = points[1][1]
+      ctrlxtag = QuadraticBezierCurve.tag(ctrlx, x, x+w)
+      ctrlytag = QuadraticBezierCurve.tag(ctrly, y, y+h)
+
+      # Trivially reject if all points are entirely to one side of
+      # the rectangle.
+      # Returning false means All points left
+      return false if x1tag < INSIDE && x2tag < INSIDE && ctrlxtag < INSIDE
+      # Returning false means All points above
+      return false if y1tag < INSIDE && y2tag < INSIDE && ctrlytag < INSIDE
+      # Returning false means All points right
+      return false if x1tag > INSIDE && x2tag > INSIDE && ctrlxtag > INSIDE
+      # Returning false means All points below
+      return false if y1tag > INSIDE && y2tag > INSIDE && ctrlytag > INSIDE
+
+      # Test for endpoints on the edge where either the segment
+      # or the curve is headed "inwards" from them
+      # Note: These tests are a superset of the fast endpoint tests
+      #       above and thus repeat those tests, but take more time
+      #       and cover more cases
+      # First endpoint on border with either edge moving inside
+      return true if inwards(x1tag, x2tag, ctrlxtag) && inwards(y1tag, y2tag, ctrlytag)
+      # Second endpoint on border with either edge moving inside
+      return true if inwards(x2tag, x1tag, ctrlxtag) && inwards(y2tag, y1tag, ctrlytag)
+
+      # Trivially accept if endpoints span directly across the rectangle
+      xoverlap = (x1tag * x2tag <= 0)
+      yoverlap = (y1tag * y2tag <= 0)
+      return true if x1tag == INSIDE && x2tag == INSIDE && yoverlap
+      return true if y1tag == INSIDE && y2tag == INSIDE && xoverlap
+
+      # We now know that both endpoints are outside the rectangle
+      # but the 3 points are not all on one side of the rectangle.
+      # Therefore the curve cannot be contained inside the rectangle,
+      # but the rectangle might be contained inside the curve, or
+      # the curve might intersect the boundary of the rectangle.
+
+      eqn = nil
+      res = []
+      if !yoverlap
+          # Both Y coordinates for the closing segment are above or
+          # below the rectangle which means that we can only intersect
+          # if the curve crosses the top (or bottom) of the rectangle
+          # in more than one place and if those crossing locations
+          # span the horizontal range of the rectangle.
+          eqn = QuadraticBezierCurve.eqn((y1tag < INSIDE ? y : y+h), y1, ctrly, y2)
+          return (QuadraticBezierCurve.solve_quadratic(eqn, res) == 2 &&
+                  QuadraticBezierCurve.eval_quadratic(res, 2, true, true, nil,
+                                x1, ctrlx, x2) == 2 &&
+                  QuadraticBezierCurve.tag(res[0], x, x+w) * QuadraticBezierCurve.tag(res[1], x, x+w) <= 0)
+      end
+
+      # Y ranges overlap.  Now we examine the X ranges
+      if !xoverlap
+          # Both X coordinates for the closing segment are left of
+          # or right of the rectangle which means that we can only
+          # intersect if the curve crosses the left (or right) edge
+          # of the rectangle in more than one place and if those
+          # crossing locations span the vertical range of the rectangle.
+          eqn = QuadraticBezierCurve.eqn((x1tag < INSIDE ? x : x+w), x1, ctrlx, x2)
+          return (QuadraticBezierCurve.solve_quadratic(eqn, res) == 2 &&
+                  QuadraticBezierCurve.eval_quadratic(res, 2, true, true, nil,
+                                y1, ctrly, y2) == 2 &&
+                  QuadraticBezierCurve.tag(res[0], y, y+h) * QuadraticBezierCurve.tag(res[1], y, y+h) <= 0)
+      end
+
+      # The X and Y ranges of the endpoints overlap the X and Y
+      # ranges of the rectangle, now find out how the endpoint
+      # line segment intersects the Y range of the rectangle
+      dx = x2 - x1
+      dy = y2 - y1
+      k = y2 * x1 - x2 * y1
+      c1tag = c2tag = nil
+      if y1tag == INSIDE
+        c1tag = x1tag
+      else
+        c1tag = QuadraticBezierCurve.tag((k + dx * (y1tag < INSIDE ? y : y+h)) / dy, x, x+w)
+      end
+      if y2tag == INSIDE
+        c2tag = x2tag
+      else
+        c2tag = QuadraticBezierCurve.tag((k + dx * (y2tag < INSIDE ? y : y+h)) / dy, x, x+w)
+      end
+      # If the part of the line segment that intersects the Y range
+      # of the rectangle crosses it horizontally - trivially accept
+      return true if c1tag * c2tag <= 0
+
+      # Now we know that both the X and Y ranges intersect and that
+      # the endpoint line segment does not directly cross the rectangle.
+      #
+      # We can almost treat this case like one of the cases above
+      # where both endpoints are to one side, except that we will
+      # only get one intersection of the curve with the vertical
+      # side of the rectangle.  This is because the endpoint segment
+      # accounts for the other intersection.
+      #
+      # (Remember there is overlap in both the X and Y ranges which
+      #  means that the segment must cross at least one vertical edge
+      #  of the rectangle - in particular, the "near vertical side" -
+      #  leaving only one intersection for the curve.)
+      #
+      # Now we calculate the y tags of the two intersections on the
+      # "near vertical side" of the rectangle.  We will have one with
+      # the endpoint segment, and one with the curve.  If those two
+      # vertical intersections overlap the Y range of the rectangle,
+      # we have an intersection.  Otherwise, we don't.
+
+      # c1tag = vertical intersection class of the endpoint segment
+      #
+      # Choose the y tag of the endpoint that was not on the same
+      # side of the rectangle as the subsegment calculated above.
+      # Note that we can "steal" the existing Y tag of that endpoint
+      # since it will be provably the same as the vertical intersection.
+      c1tag = ((c1tag * x1tag <= 0) ? y1tag : y2tag)
+
+      # c2tag = vertical intersection class of the curve
+      #
+      # We have to calculate this one the straightforward way.
+      # Note that the c2tag can still tell us which vertical edge
+      # to test against.
+      eqn = QuadraticBezierCurve.eqn((c2tag < INSIDE ? x : x+w), x1, ctrlx, x2)
+      num = QuadraticBezierCurve.solve_quadratic(eqn, res)
+
+      # Note: We should be able to assert(num == 2) since the
+      # X range "crosses" (not touches) the vertical boundary,
+      # but we pass num to QuadraticBezierCurve.eval_quadratic for completeness.
+      QuadraticBezierCurve.eval_quadratic(res, num, true, true, nil, y1, ctrly, y2)
+
+      # Note: We can assert(num evals == 1) since one of the
+      # 2 crossings will be out of the [0,1] range.
+      c2tag = QuadraticBezierCurve.tag(res[0], y, y+h)
+
+      # Finally, we have an intersection if the two crossings
+      # overlap the Y range of the rectangle.
+      c1tag * c2tag <= 0
+    end
   end
 end

data/lib/perfect_shape/rectangle.rb

@@ -41,13 +41,15 @@ module PerfectShape
     # bitmask indicating a point lies below
     OUT_BOTTOM = 8
         
+    RECT_INTERSECTS = 0x80000000
+        
     # Checks if rectangle 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 rectangle, {@code false} if the point lies outside of the
+    # @return true if the point lies within the bound of
+    # the rectangle, false if the point lies outside of the
     # rectangle's bounds.
     def contain?(x_or_point, y = nil, outline: false, distance_tolerance: 0)
       x, y = Point.normalize_point(x_or_point, y)
@@ -95,5 +97,24 @@ module PerfectShape
       end
       out
     end
+    
+    # A rectangle is empty if its width or height is 0 (or less)
+    def empty?
+      width <= 0.0 || height <= 0.0
+    end
+    
+    def intersect?(rectangle)
+      x = rectangle.x
+      y = rectangle.y
+      w = rectangle.width
+      h = rectangle.height
+      return false if empty? || w <= 0 || h <= 0
+      x0 = self.x
+      y0 = self.y
+      (x + w) > x0 &&
+        (y + h) > y0 &&
+        x < (x0 + self.width) &&
+        y < (y0 + self.height)
+    end
   end
 end

data/lib/perfect_shape/square.rb

@@ -23,12 +23,15 @@ require 'perfect_shape/rectangle'
 
 module PerfectShape
   class Square < Rectangle
-    MESSAGE_WIDTH_AND_HEIGHT_AND_LENGTH_NOT_EQUAL = 'Square width, height, and length must all be equal if more than one is specified; or otherwise keep only one of them in arguments!'
+    MESSAGE_WIDTH_AND_HEIGHT_AND_LENGTH_NOT_EQUAL = 'Square width, height, and length must all be equal if more than one is specified; or otherwise keep only one of them in constructor arguments!'
   
     attr_reader :length
+    alias size length
     
     # Constructs with x, y, length (optionally width or height can be passed as alias for length)
-    def initialize(x: 0, y: 0, length: nil, width: nil, height: nil)
+    def initialize(x: 0, y: 0, length: nil, size: nil, width: nil, height: nil)
+      raise MESSAGE_WIDTH_AND_HEIGHT_AND_LENGTH_NOT_EQUAL if (length && size && length != size)
+      length ||= size
       raise MESSAGE_WIDTH_AND_HEIGHT_AND_LENGTH_NOT_EQUAL if (length && width && length != width) || (length && height && length != height) || (width && height && width != height)
       length ||= width || height || 1
       super(x: x, y: y, width: length, height: length)
@@ -40,6 +43,7 @@ module PerfectShape
       self.width = value unless width == value
       self.height = value unless height == value
     end
+    alias size= length=
     
     def width=(value)
       super

data/perfect-shape.gemspec

@@ -2,16 +2,16 @@
 # DO NOT EDIT THIS FILE DIRECTLY
 # Instead, edit Juwelier::Tasks in Rakefile, and run 'rake gemspec'
 # -*- encoding: utf-8 -*-
-# stub: perfect-shape 0.5.1 ruby lib
+# stub: perfect-shape 0.5.5 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "perfect-shape".freeze
-  s.version = "0.5.1"
+  s.version = "0.5.5"
 
   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 = "2022-01-19"
+  s.date = "2022-01-22"
   s.description = "Perfect Shape is a collection of pure Ruby geometric algorithms that are mostly useful for GUI manipulation like checking viewport rectangle intersection or 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 bezier curves, potentially with affine transforms applied like translation, scale, rotation, shear/skew, and inversion (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 = [

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: perfect-shape
 version: !ruby/object:Gem::Version
-  version: 0.5.1
+  version: 0.5.5
 platform: ruby
 authors:
 - Andy Maleh
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2022-01-19 00:00:00.000000000 Z
+date: 2022-01-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: equalizer