perfect-shape 0.0.9 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 934071723ece0f7ebe64e6e67880b5a1f4ec6781517d2ee2a7dea70ceae4a9be
-  data.tar.gz: d436da8745d7f4d971a7df04b5d54701e6e89abb9f8624273f79a6ac1d28ea77
+  metadata.gz: a4eb7bc277a02c0795966623e05ee57514483d982bc0d80f264a525f6b3d5afa
+  data.tar.gz: f070a8292b835f6d2c68ff4ccddd3073b7a83d36e882d4e5c34c6e91a85d88ee
 SHA512:
-  metadata.gz: bcea5c4c02f2e056c0e18a857404bbef4b411420c2c3a7e438a2f122df90a30466979c60cc7804c61b5d454ed2879cd81fd1fc750360839393c20a4561aebce6
-  data.tar.gz: c321b5b1697b28e9608c11d4bc5e04038c3e269df311b9c7263e468c6f952c60bec6ecf4244ff044eb8fb33cf68462e9d362326962c0473bbd72150847181e0e
+  metadata.gz: 1add8519bdd16f38f8fb8431d8342c77df9f5d8d76f0dc6f1481bba5d9c0a15b653c56a9a0e372082f1590b55f5897ebac3f6a4d4505acd6ba017f257261e80d
+  data.tar.gz: fc3e2fce45f0a46ad7869fd5fec07d0dcf826e3bd36676439144eb3fd0198b8224d816a26db54858b43d0bb5332ff6b4108950efca3e71c1d5e42cebde4de63f

data/CHANGELOG.md

@@ -1,5 +1,32 @@
 # 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)
+- `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#==`
+- `PerfectShape::Line#==`
+- `PerfectShape::Point#==`
+
+## 0.0.10
+
+- `PerfectShape::Point`
+- `PerfectShape::Point#point_distance`
+- `PerfectShape::Point#contain?(x_or_point, y=nil, distance: 0)`
+- Refactor `PerfectShape::Point`,`PerfectShape::RectangularShape` to include shared `PerfectShape::PointLocation`
+
 ## 0.0.9
 
 - `PerfectShape::Line#contain?(x_or_point, y=nil, distance: 0)` (add a distance tolerance fuzz factor option)
@@ -14,6 +41,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.9
+# 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` 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), 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` 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.9
+gem install perfect-shape -v 0.1.1
 ```
 
 Or include in Bundler `Gemfile`:
 
 ```ruby
-gem 'perfect-shape', '~> 0.0.9'
+gem 'perfect-shape', '~> 0.1.1'
 ```
 
 And, run:
@@ -43,6 +44,8 @@ Module
 
 Class
 
+This is a base class for all shapes. It is not meant to be used directly. Subclasses implement/override its methods as needed.
+
 - `#min_x`: min x
 - `#min_y`: min y
 - `#max_x`: max x
@@ -52,12 +55,25 @@ Class
 - `#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`
+
+Module
+
+- `#initialize(x: 0, y: 0)`: initializes a point location, usually representing the top-left point in a shape
+- `#x`: top-left x
+- `#y`: top-left y
+- `#min_x`: min x (x by default)
+- `#min_y`: min y (y by default)
 
 ### `PerfectShape::RectangularShape`
 
 Module
 
+Includes `PerfectShape::PointLocation`
+
 - `#initialize(x: 0, y: 0, width: 1, height: 1)`: initializes a rectangular shape
 - `#x`: top-left x
 - `#y`: top-left y
@@ -71,18 +87,53 @@ Module
 - `#center_y`: center y
 - `#bounding_box`: bounding box is a rectangle with x = min x, y = min y, and width/height of shape
 
+### `PerfectShape::Point`
+
+Class
+
+Extends `PerfectShape::Shape`
+
+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.
+
+- `::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.
+- `#min_x`: min x (always x)
+- `#min_y`: min y (always y)
+- `#max_x`: max x (always x)
+- `#max_y`: max y (always y)
+- `#width`: width (always 0)
+- `#height`: height (always 0)
+- `#center_x`: center x (always x)
+- `#center_y`: center y (always 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, distance: 0)`: checks if point matches self, with a distance tolerance (0 by default). Distance tolerance provides a fuzz factor that for example enables GUI users to mouse-click-select a point shape in a GUI more successfully.
+- `#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
 
 Extends `PerfectShape::Shape`
 
-![line](images/line.png)
+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: [])`: 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
@@ -95,6 +146,42 @@ Extends `PerfectShape::Shape`
 - `#contain?(x_or_point, y=nil, distance: 0)`: checks if point lies on line, with a distance tolerance (0 by default). Distance tolerance provides a fuzz factor that for example enables GUI users to mouse-click-select a line shape in a GUI more successfully.
 - `#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 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(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`
 
@@ -104,7 +191,7 @@ Extends `PerfectShape::Shape`
 
 Includes `PerfectShape::RectangularShape`
 
-![rectangle](images/rectangle.png)
+![rectangle](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/rectangle.png)
 
 - `::new(x: 0, y: 0, width: 1, height: 1)`: constructs a rectangle
 - `#x`: top-left x
@@ -119,6 +206,13 @@ Includes `PerfectShape::RectangularShape`
 - `#max_y`: max 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
+- `#==(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`
 
@@ -126,7 +220,7 @@ Class
 
 Extends `PerfectShape::Rectangle`
 
-![square](images/square.png)
+![square](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/square.png)
 
 - `::new(x: 0, y: 0, length: 1)`: constructs a square
 - `#x`: top-left x
@@ -142,6 +236,13 @@ Extends `PerfectShape::Rectangle`
 - `#max_y`: max 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
+- `#==(other)`: Returns `true` if equal to `other` or `false` otherwise
+
+Example:
+
+```ruby
+shape = PerfectShape::Square.new(x: 15, y: 30, length: 200)
+```
 
 ### `PerfectShape::Arc`
 
@@ -155,7 +256,7 @@ Arcs can be of type `:open`, `:chord`, or `:pie`
 
 Open Arc | Chord Arc | Pie Arc
 ---------|-----------|--------
-![arc-open](images/arc-open.png) | ![arc-chord](images/arc-chord.png) | ![arc-pie](images/arc-pie.png)
+![arc-open](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/arc-open.png) | ![arc-chord](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/arc-chord.png) | ![arc-pie](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/arc-pie.png)
 
 - `::new(type: :open, x: 0, y: 0, width: 1, height: 1, start: 0, extent: 360, center_x: nil, center_y: nil, radius_x: nil, radius_y: nil)`: constructs an arc of type  `:open` (default), `:chord`, or `:pie`
 - `#type`: `:open`, `:chord`, or `:pie`
@@ -175,6 +276,14 @@ Open Arc | Chord Arc | Pie Arc
 - `#max_y`: max 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
+- `#==(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`
 
@@ -182,7 +291,7 @@ Class
 
 Extends `PerfectShape::Arc`
 
-![ellipse](images/ellipse.png)
+![ellipse](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/ellipse.png)
 
 - `::new(x: 0, y: 0, width: 1, height: 1, center_x: nil, center_y: nil, radius_x: nil, radius_y: nil)`: constructs an ellipse
 - `#x`: top-left x
@@ -202,6 +311,14 @@ Extends `PerfectShape::Arc`
 - `#max_y`: max 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
+- `#==(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`
 
@@ -209,7 +326,7 @@ Class
 
 Extends `PerfectShape::Ellipse`
 
-![circle](images/circle.png)
+![circle](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/circle.png)
 
 - `::new(x: 0, y: 0, diameter: 1, width: 1, height: 1, center_x: nil, center_y: nil, radius: nil, radius_x: nil, radius_y: nil)`: constructs a circle
 - `#x`: top-left x
@@ -231,6 +348,14 @@ Extends `PerfectShape::Ellipse`
 - `#max_y`: max 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
+- `#==(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`
 
@@ -238,9 +363,13 @@ Class
 
 Extends `PerfectShape::Shape`
 
-![polygon](images/polygon.png)
+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.
 
-- `::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
+![polygon](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/polygon.png)
+
+- `::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
@@ -251,6 +380,52 @@ Extends `PerfectShape::Shape`
 - `#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 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
+
+Extends `PerfectShape::Shape`
+
+Includes `PerfectShape::MultiPoint`
+
+![path](https://raw.githubusercontent.com/AndyObtiva/perfect-shape/master/images/path.png)
+
+- `::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
+- `#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 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
 

data/VERSION

@@ -1 +1 @@
-0.0.9
+0.1.1

data/lib/perfect_shape/arc.rb

@@ -135,7 +135,7 @@ module PerfectShape
       @height = nil
     end
     
-    # Checks if arc contains point denoted by point (two-number Array or x, y args)
+    # Checks if arc 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.

data/lib/perfect_shape/ellipse.rb

@@ -55,7 +55,7 @@ module PerfectShape
       end
     end
     
-    # Checks if ellipse contains point denoted by point (two-number Array or x, y args)
+    # Checks if ellipse 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.

data/lib/perfect_shape/line.rb

@@ -182,25 +182,41 @@ 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 BigDecimal('0') if (py <  y1 && py <  y2)
+        return BigDecimal('0') if (py >= y1 && py >= y2)
+        # assert(y1 != y2);
+        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 BigDecimal('0') if (px >= xintercept)
+        (y1 < y2) ? BigDecimal('1') : BigDecimal('-1')
+      end
     end
     
     include MultiPoint
+    include Equalizer.new(:points)
     
-    # Checks if polygon contains point denoted by point (two-number Array or x, y args)
-    # using the Ray Casting Algorithm (aka Even-Odd Rule): https://en.wikipedia.org/wiki/Point_in_polygon
+    # Checks if line contains point (two-number Array or x, y args), with distance tolerance (0 by default)
     #
     # @param x The X coordinate of the point to test.
     # @param y The Y coordinate of the point to test.
+    # @param distance The distance from line to tolerate (0 by default)
     #
     # @return {@code true} if the point lies within the bound of
-    # the polygon, {@code false} if the point lies outside of the
-    # polygon's bounds.
+    # the line, {@code false} if the point lies outside of the
+    # line's bounds.
     def contain?(x_or_point, y = nil, distance: 0)
       x, y = normalize_point(x_or_point, y)
       return unless x && y
       distance = BigDecimal(distance.to_s)
-      # TODO implement contain?(point) with a fuzz factor to enable successfully selecting a line in a GUI application
-      Line.point_segment_distance(points[0][0], points[0][1], points[1][0], points[1][1], x, y) <= distance
+      point_segment_distance(x, y) <= distance
     end
     
     def point_segment_distance(x_or_point, y = nil)
@@ -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/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
@@ -55,13 +55,5 @@ module PerfectShape
     def max_y
       points.map(&:last).max
     end
-    
-    def width
-      max_x - min_x if min_x && max_x
-    end
-    
-    def height
-      max_y - min_y if min_y && max_y
-    end
   end
 end

data/lib/perfect_shape/path.rb

@@ -0,0 +1,209 @@
+# 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/quadratic_bezier_curve'
+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
+      the_points = []
+      @shapes.each do |shape|
+        case shape
+        when Point
+          the_points << shape.to_a
+        when Array
+          the_points << shape.map {|n| BigDecimal(n.to_s)}
+        when Line
+          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
+      the_points << @shapes.first.to_a if closed?
+      the_points
+    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
+          :quad_to
+#         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).to_i & 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 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 = BigDecimal('0')
+      ci = BigDecimal('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
+            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,
+#                                              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

@@ -0,0 +1,88 @@
+# 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_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)
+        x = BigDecimal(x.to_s)
+        y = BigDecimal(y.to_s)
+        px = BigDecimal(px.to_s)
+        py = BigDecimal(py.to_s)
+        BigDecimal(Math.sqrt((px - x)**2 + (py - y)**2).to_s)
+      end
+    end
+    
+    include PointLocation
+    include Equalizer.new(:x, :y)
+    
+    def initialize(x_or_point = nil, y_arg = nil, x: nil, y: nil)
+      if x_or_point.is_a?(Array)
+        x, y = x_or_point
+        super(x: x, y: y)
+      elsif x_or_point && y_arg
+        super(x: x_or_point, y: y_arg)
+      else
+        x ||= 0
+        y ||= 0
+        super(x: x, y: y)
+      end
+    end
+    
+    def max_x
+      x
+    end
+    
+    def max_y
+      y
+    end
+    
+    # Checks if points match, with distance tolerance (0 by default)
+    #
+    # @param x The X coordinate of the point to test.
+    # @param y The Y coordinate of the point to test.
+    # @param distance 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.
+    def contain?(x_or_point, y = nil, distance: 0)
+      x, y = normalize_point(x_or_point, y)
+      return unless x && y
+      distance = BigDecimal(distance.to_s)
+      point_distance(x, y) <= distance
+    end
+    
+    def point_distance(x_or_point, y = nil)
+      x, y = normalize_point(x_or_point, y)
+      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

@@ -0,0 +1,54 @@
+# 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.
+
+module PerfectShape
+  # Point location usually represents the top-left point in a shape
+  module PointLocation
+    attr_reader :x, :y
+    
+    # Calls super before setting x,y (default: 0,0)
+    def initialize(x: 0, y: 0)
+      super()
+      self.x = x
+      self.y = y
+    end
+    
+    # Sets x, normalizing to BigDecimal
+    def x=(value)
+      @x = BigDecimal(value.to_s)
+    end
+    
+    # Sets y, normalizing to BigDecimal
+    def y=(value)
+      @y = BigDecimal(value.to_s)
+    end
+    
+    # Returns x by default. Subclasses may override.
+    def min_x
+      x
+    end
+    
+    # Returns y by default. Subclasses may override.
+    def min_y
+      y
+    end
+  end
+end

data/lib/perfect_shape/polygon.rb

@@ -26,8 +26,9 @@ module PerfectShape
   # Mostly ported from java.awt.geom: https://docs.oracle.com/javase/8/docs/api/java/awt/Polygon.html
   class Polygon < Shape
     include MultiPoint
+    include Equalizer.new(:points)
     
-    # Checks if polygon contains point denoted by point (two-number Array or x, y args)
+    # Checks if polygon contains point (two-number Array or x, y args)
     # using the Ray Casting Algorithm (aka Even-Odd Rule): https://en.wikipedia.org/wiki/Point_in_polygon
     #
     # @param x The X coordinate of the point to test.

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/lib/perfect_shape/rectangle.rb

@@ -28,7 +28,7 @@ module PerfectShape
     include RectangularShape
     include Equalizer.new(:x, :y, :width, :height)
         
-    # Checks if rectangle contains point denoted by point (two-number Array or x, y args)
+    # 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.

data/lib/perfect_shape/rectangular_shape.rb

@@ -19,31 +19,23 @@
 # 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/point_location'
+
 module PerfectShape
   # Mixin Module for Rectangular Shapes (having x, y, width, height)
   # Can only be mixed into a class extending Shape or another module
   module RectangularShape
-    attr_reader :x, :y, :width, :height
+    include PointLocation
+    
+    attr_reader :width, :height
     
     # Calls super before setting x, y, width, height
     def initialize(x: 0, y: 0, width: 1, height: 1)
-      super()
-      self.x = x
-      self.y = y
+      super(x: x, y: y)
       self.width = width
       self.height = height
     end
     
-    # Sets x, normalizing to BigDecimal
-    def x=(value)
-      @x = BigDecimal(value.to_s)
-    end
-    
-    # Sets y, normalizing to BigDecimal
-    def y=(value)
-      @y = BigDecimal(value.to_s)
-    end
-    
     # Sets width, normalizing to BigDecimal
     def width=(value)
       @width = BigDecimal(value.to_s)
@@ -54,14 +46,6 @@ module PerfectShape
       @height = BigDecimal(value.to_s)
     end
     
-    def min_x
-      @x
-    end
-    
-    def min_y
-      @y
-    end
-    
     def max_x
       @x + width if @x && width
     end

data/lib/perfect_shape/shape.rb

@@ -20,7 +20,8 @@
 # WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 module PerfectShape
-  # Superclass of all shapes
+  # Superclass of all shapes. Not meant to be used directly.
+  # Subclasses must implement/override methods as needed.
   class Shape
     # Subclasses must implement
     def min_x
@@ -38,12 +39,16 @@ module PerfectShape
     def max_y
     end
     
-    # Subclasses must implement
+    # Default implementation is max_x - min_x
+    # Subclasses can override
     def width
+      max_x - min_x if max_x && min_x
     end
     
-    # Subclasses must implement
+    # Default implementation is max_y - min_y
+    # Subclasses can override
     def height
+      max_y - min_y if max_y && min_y
     end
     
     # center_x is min_x + width/2.0 by default
@@ -78,5 +83,9 @@ module PerfectShape
       y = BigDecimal(y.to_s)
       [x, y]
     end
+    
+    # Subclasses must implement
+    def ==(other)
+    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.0.9 ruby lib
+# stub: perfect-shape 0.1.1 ruby lib
 
 Gem::Specification.new do |s|
   s.name = "perfect-shape".freeze
-  s.version = "0.0.9"
+  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-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, 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,7 +31,11 @@ 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",
+    "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,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: perfect-shape
 version: !ruby/object:Gem::Version
-  version: 0.0.9
+  version: 0.1.1
 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,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 (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, 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,7 +120,11 @@ 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
+- lib/perfect_shape/quadratic_bezier_curve.rb
 - lib/perfect_shape/rectangle.rb
 - lib/perfect_shape/rectangular_shape.rb
 - lib/perfect_shape/shape.rb