From b735a3ec9561964f9cdc5be37f8c5d3741433db1 Mon Sep 17 00:00:00 2001
From: Jan <development@iconexperience.com>
Date: Tue, 7 Jun 2016 16:11:37 +0200
Subject: [PATCH] Fix getInteriorPoint()

getInteriorPoint() could return a point outside the path as explained in #1064
This fix excludes curve's start points from intercept detection to prevent double counting, it ensures that all intercepts are collected and the intercepts are sorted by x-value.
---
 src/path/PathItem.Boolean.js | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/src/path/PathItem.Boolean.js b/src/path/PathItem.Boolean.js
index b79b527b..11914630 100644
--- a/src/path/PathItem.Boolean.js
+++ b/src/path/PathItem.Boolean.js
@@ -1028,7 +1028,7 @@ Path.inject(/** @lends Path# */{
             // Since there is no guarantee that a poly-bezier path contains
             // the center of its bounding rectangle, we shoot a ray in
             // +x direction from the center and select a point between
-            // consecutive intersections of the ray
+            // consecutive intersections of the ray.
             var curves = this._getMonoCurves(),
                 roots = [],
                 y = point.y,
@@ -1036,16 +1036,15 @@ Path.inject(/** @lends Path# */{
             for (var i = 0, l = curves.length; i < l; i++) {
                 var values = curves[i].values;
                 if ((curves[i].winding === 1
-                        && y >= values[1] && y <= values[7]
-                        || y >= values[7] && y <= values[1])) {
+                        && y > values[1] && y <= values[7]
+                        || y >= values[7] && y < values[1])) {
                     var count = Curve.solveCubic(values, 1, y, roots, 0, 1);
                     for (var j = count - 1; j >= 0; j--) {
                         intercepts.push(Curve.getPoint(values, roots[j]).x);
                     }
                 }
-                if (intercepts.length > 1)
-                    break;
             }
+            intercepts.sort();
             point.x = (intercepts[0] + intercepts[1]) / 2;
         }
         return point;