From bf7a901b6114d4b6bb025f5f37c623be7728665b Mon Sep 17 00:00:00 2001
From: alexbol99 <alexbol99@gmail.com>
Date: Sat, 15 May 2021 16:57:09 +0300
Subject: [PATCH] - Commit pull request #88 Reverse arc direction when
 reflecting over a single axis, publish compiled package

---
 .idea/workspace.xml | 141 ++++++++++++++++++++++----------------------
 dist/main.cjs.js    |  42 ++++++++++++-
 dist/main.esm.js    |  42 ++++++++++++-
 dist/main.umd.js    |  42 ++++++++++++-
 package-lock.json   |  10 ++--
 package.json        |   2 +-
 src/classes/arc.js  |   4 +-
 7 files changed, 195 insertions(+), 88 deletions(-)

diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 62378d4f..8b204440 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -32,9 +32,14 @@
     <select />
   </component>
   <component name="ChangeListManager">
-    <list default="true" id="3bad4cc5-c7a3-4d34-95ab-991545541eec" name="Default" comment="- Issue #65vPolygon.contains with Segment returns wrong result&#10;- Release patch 1.2.22">
+    <list default="true" id="3bad4cc5-c7a3-4d34-95ab-991545541eec" name="Default" comment="- Fixed typo in documentation and README">
       <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/test/algorithms/boolean_op.js" beforeDir="false" afterPath="$PROJECT_DIR$/test/algorithms/boolean_op.js" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/dist/main.cjs.js" beforeDir="false" afterPath="$PROJECT_DIR$/dist/main.cjs.js" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/dist/main.esm.js" beforeDir="false" afterPath="$PROJECT_DIR$/dist/main.esm.js" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/dist/main.umd.js" beforeDir="false" afterPath="$PROJECT_DIR$/dist/main.umd.js" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/package-lock.json" beforeDir="false" afterPath="$PROJECT_DIR$/package-lock.json" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/package.json" beforeDir="false" afterPath="$PROJECT_DIR$/package.json" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/src/classes/arc.js" beforeDir="false" afterPath="$PROJECT_DIR$/src/classes/arc.js" afterDir="false" />
     </list>
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
@@ -127,7 +132,7 @@
       <recent name="C:\Users\Alex Bol\WebstormProjects\flatten-js\types" />
     </key>
   </component>
-  <component name="RunManager" selected="Mocha.#Algorithms.Boolean Operations.#Algorithms.Boolean Subtraction.Can perform subtract. issue #76">
+  <component name="RunManager" selected="Mocha.#Flatten.Polygon">
     <configuration default="true" type="js.build_tools.gulp">
       <node-interpreter>project</node-interpreter>
       <node-options />
@@ -167,7 +172,7 @@
       <envs />
       <method v="2" />
     </configuration>
-    <configuration name="#Algorithms.Boolean Operations.#Algorithms.Boolean Subtraction.Can perform subtract. issue #76" type="mocha-javascript-test-runner" temporary="true" nameIsGenerated="true">
+    <configuration name="#Flatten.Polygon" type="mocha-javascript-test-runner" temporary="true" nameIsGenerated="true">
       <node-interpreter>project</node-interpreter>
       <node-options />
       <mocha-package>$PROJECT_DIR$/node_modules/mocha</mocha-package>
@@ -175,27 +180,26 @@
       <pass-parent-env>true</pass-parent-env>
       <ui>bdd</ui>
       <extra-mocha-options>--require @babel/register</extra-mocha-options>
-      <test-kind>TEST</test-kind>
-      <test-file>$PROJECT_DIR$/test/algorithms/boolean_op.js</test-file>
+      <test-kind>SUITE</test-kind>
+      <test-file>$PROJECT_DIR$/test/classes/polygon.js</test-file>
       <test-names>
-        <name value="#Algorithms.Boolean Operations" />
-        <name value="#Algorithms.Boolean Subtraction" />
-        <name value="Can perform subtract. issue #76" />
+        <name value="#Flatten.Polygon" />
       </test-names>
       <method v="2" />
     </configuration>
-    <configuration name="#Algorithms.Relation" type="mocha-javascript-test-runner" temporary="true" nameIsGenerated="true">
+    <configuration name="#Flatten.Polygon.Can parse GeoJSON one-loop polygon" type="mocha-javascript-test-runner" temporary="true" nameIsGenerated="true">
       <node-interpreter>project</node-interpreter>
       <node-options />
       <mocha-package>$PROJECT_DIR$/node_modules/mocha</mocha-package>
       <working-directory>$PROJECT_DIR$</working-directory>
       <pass-parent-env>true</pass-parent-env>
       <ui>bdd</ui>
-      <extra-mocha-options>--require @babel/register</extra-mocha-options>
-      <test-kind>SUITE</test-kind>
-      <test-file>$PROJECT_DIR$/test/algorithms/relation.js</test-file>
+      <extra-mocha-options />
+      <test-kind>TEST</test-kind>
+      <test-file>$PROJECT_DIR$/test/classes/polygon.js</test-file>
       <test-names>
-        <name value="#Algorithms.Relation" />
+        <name value="#Flatten.Polygon" />
+        <name value="Can parse GeoJSON one-loop polygon" />
       </test-names>
       <method v="2" />
     </configuration>
@@ -214,19 +218,19 @@
     </configuration>
     <list>
       <item itemvalue="Mocha.#test esm" />
-      <item itemvalue="Mocha.#Algorithms.Relation" />
-      <item itemvalue="Mocha.#Algorithms.Boolean Operations.#Algorithms.Boolean Subtraction.Can perform subtract. issue #76" />
+      <item itemvalue="Mocha.#Flatten.Polygon" />
+      <item itemvalue="Mocha.#Flatten.Polygon.Can parse GeoJSON one-loop polygon" />
       <item itemvalue="npm.build" />
       <item itemvalue="npm.publish-npm" />
       <item itemvalue="npm.test" />
     </list>
     <recent_temporary>
       <list>
+        <item itemvalue="npm.build" />
         <item itemvalue="npm.test" />
-        <item itemvalue="Mocha.#Algorithms.Boolean Operations.#Algorithms.Boolean Subtraction.Can perform subtract. issue #76" />
-        <item itemvalue="Mocha.#Algorithms.Relation" />
         <item itemvalue="npm.publish-npm" />
-        <item itemvalue="npm.build" />
+        <item itemvalue="Mocha.#Flatten.Polygon" />
+        <item itemvalue="Mocha.#Flatten.Polygon.Can parse GeoJSON one-loop polygon" />
       </list>
     </recent_temporary>
   </component>
@@ -383,11 +387,45 @@
       <workItem from="1604731436227" duration="751000" />
       <workItem from="1610708618258" duration="4757000" />
       <workItem from="1611775761179" duration="494000" />
-      <workItem from="1611776304703" duration="9095000" />
-      <workItem from="1614350714340" duration="186000" />
-      <workItem from="1614350963373" duration="78000" />
-      <workItem from="1614351109068" duration="249000" />
-      <workItem from="1616758130407" duration="22748000" />
+      <workItem from="1611776304703" duration="7156000" />
+      <workItem from="1621071991303" duration="405000" />
+      <workItem from="1621072484251" duration="451000" />
+      <workItem from="1621085867217" duration="977000" />
+    </task>
+    <task id="LOCAL-00136" summary="- Add new methods Face::shapes (getter function) and Face::toPolygon(), Polygon::toArray()&#10;- Simplify code for polygon transform methods, add tests, docs updated">
+      <created>1578644089358</created>
+      <option name="number" value="00136" />
+      <option name="presentableId" value="LOCAL-00136" />
+      <option name="project" value="LOCAL" />
+      <updated>1578644089358</updated>
+    </task>
+    <task id="LOCAL-00137" summary="- Fix inheritance conflict by removing &quot;edges&quot; parameter from Face methods append, insert, delete; update docs, tests and typescript definition (wikywin note in the issue #3)&#10;- Upgrade dependency to @flatten-js/interval-tree@1.0.10 with fixed default export definition - fix typescript error on importing this package">
+      <created>1578663619628</created>
+      <option name="number" value="00137" />
+      <option name="presentableId" value="LOCAL-00137" />
+      <option name="project" value="LOCAL" />
+      <updated>1578663619628</updated>
+    </task>
+    <task id="LOCAL-00138" summary="- Allow creation of polygon using constructor without need for addFace() method, updated typescript definition, tests and documentation &#10;- Allow creation of polygon from array of numeric pairs, or from a nested array of numeric pairs (issue #23)">
+      <created>1578742345011</created>
+      <option name="number" value="00138" />
+      <option name="presentableId" value="LOCAL-00138" />
+      <option name="project" value="LOCAL" />
+      <updated>1578742345011</updated>
+    </task>
+    <task id="LOCAL-00139" summary="- Added method Polygon::splitToIslands() to split polygon into array of islands, where each island polygon includes holes that it contains (issue #9 from boolean-op package)">
+      <created>1578747826786</created>
+      <option name="number" value="00139" />
+      <option name="presentableId" value="LOCAL-00139" />
+      <option name="project" value="LOCAL" />
+      <updated>1578747826786</updated>
+    </task>
+    <task id="LOCAL-00140" summary="- Upgrade minor version to 1.1.0">
+      <created>1578748480863</created>
+      <option name="number" value="00140" />
+      <option name="presentableId" value="LOCAL-00140" />
+      <option name="project" value="LOCAL" />
+      <updated>1578748480863</updated>
     </task>
     <task id="LOCAL-00141" summary="- Extend Ray to be any angle (not completed)">
       <created>1579030776012</created>
@@ -697,42 +735,7 @@
       <option name="project" value="LOCAL" />
       <updated>1611863342220</updated>
     </task>
-    <task id="LOCAL-00185" summary="- Ability tp construct PlanarSet with array or set of shapes">
-      <created>1611923216426</created>
-      <option name="number" value="00185" />
-      <option name="presentableId" value="LOCAL-00185" />
-      <option name="project" value="LOCAL" />
-      <updated>1611923216426</updated>
-    </task>
-    <task id="LOCAL-00186" summary="- Fix issue #81 Infinite loop when subtracting polygons, added test case&#10;- When line, intersect polygon, sort intersection points along line">
-      <created>1616766843746</created>
-      <option name="number" value="00186" />
-      <option name="presentableId" value="LOCAL-00186" />
-      <option name="project" value="LOCAL" />
-      <updated>1616766843746</updated>
-    </task>
-    <task id="LOCAL-00187" summary="- Fix issue #81 Infinite loop when subtracting polygons, added test case&#10;- intersectLine2Polygon : sort intersection points along line">
-      <created>1616766981145</created>
-      <option name="number" value="00187" />
-      <option name="presentableId" value="LOCAL-00187" />
-      <option name="project" value="LOCAL" />
-      <updated>1616766981145</updated>
-    </task>
-    <task id="LOCAL-00188" summary="- Update documentation, create patch 1.2.21">
-      <created>1616911302053</created>
-      <option name="number" value="00188" />
-      <option name="presentableId" value="LOCAL-00188" />
-      <option name="project" value="LOCAL" />
-      <updated>1616911302054</updated>
-    </task>
-    <task id="LOCAL-00189" summary="- Issue #65vPolygon.contains with Segment returns wrong result&#10;- Release patch 1.2.22">
-      <created>1616924147009</created>
-      <option name="number" value="00189" />
-      <option name="presentableId" value="LOCAL-00189" />
-      <option name="project" value="LOCAL" />
-      <updated>1616924147009</updated>
-    </task>
-    <option name="localTasksCounter" value="190" />
+    <option name="localTasksCounter" value="185" />
     <servers />
   </component>
   <component name="TypeScriptGeneratedFilesManager">
@@ -751,6 +754,11 @@
     <option name="oldMeFiltersMigrated" value="true" />
   </component>
   <component name="VcsManagerConfiguration">
+    <MESSAGE value="- Fix bug in relateShapeToPolygon" />
+    <MESSAGE value="- Fix bug in relatePolygonToPolygon&#10;- Remove redundant export regexp from relations module" />
+    <MESSAGE value="- Release patch 1.2.2" />
+    <MESSAGE value="- Add boolean operations test&#10;- Fix bug in Arc::split() method" />
+    <MESSAGE value="- New README.md (not completed)" />
     <MESSAGE value="- Complete Serialization and Visualization sections of README.md&#10;- Release patch" />
     <MESSAGE value="- Added relation between circles, boxes and polygon (issue #41 Intersect between two circles missing)" />
     <MESSAGE value="- Fix issue #42 Intersect does not seem to work when a shape is inside another" />
@@ -771,12 +779,7 @@
     <MESSAGE value="- added Buy Me A Coffee button to README.md" />
     <MESSAGE value="- Fix order of arguments in addVertex method. Pull request #73 &#10;- Type declaration for Arc is incorrect. Pull request #74&#10;- Fix tolerance typings. Pull request #75&#10;- Documentation mistake: BooleanOp. Issue #77&#10;- Release patch v1.2.19" />
     <MESSAGE value="- Support GeoJSON polygon and multi-polygon parsing (added tests from GeoJSON spec)&#10;- Release patch v1.2.20" />
-    <MESSAGE value="- Ability tp construct PlanarSet with array or set of shapes" />
-    <MESSAGE value="- Fix issue #81 Infinite loop when subtracting polygons, added test case&#10;- When line, intersect polygon, sort intersection points along line" />
-    <MESSAGE value="- Fix issue #81 Infinite loop when subtracting polygons, added test case&#10;- intersectLine2Polygon : sort intersection points along line" />
-    <MESSAGE value="- Update documentation, create patch 1.2.21" />
-    <MESSAGE value="- Issue #65vPolygon.contains with Segment returns wrong result&#10;- Release patch 1.2.22" />
-    <option name="LAST_COMMIT_MESSAGE" value="- Issue #65vPolygon.contains with Segment returns wrong result&#10;- Release patch 1.2.22" />
+    <option name="LAST_COMMIT_MESSAGE" value="- Support GeoJSON polygon and multi-polygon parsing (added tests from GeoJSON spec)&#10;- Release patch v1.2.20" />
     <option name="REARRANGE_BEFORE_PROJECT_COMMIT" value="true" />
   </component>
   <component name="XDebuggerManager">
@@ -793,12 +796,6 @@
           <line>356</line>
           <option name="timeStamp" value="7" />
         </line-breakpoint>
-        <line-breakpoint enabled="true" type="javascript">
-          <url>file://$PROJECT_DIR$/test/algorithms/boolean_op.js</url>
-          <line>620</line>
-          <properties lambdaOrdinal="-1" />
-          <option name="timeStamp" value="38" />
-        </line-breakpoint>
       </breakpoints>
     </breakpoint-manager>
     <watches-manager>
diff --git a/dist/main.cjs.js b/dist/main.cjs.js
index 5a58b9f2..7e847f22 100644
--- a/dist/main.cjs.js
+++ b/dist/main.cjs.js
@@ -3354,7 +3354,7 @@ class IntervalTree {
     /**
      * Returns array of entry values which keys intersect with given interval <br/>
      * If no values stored in the tree, returns array of keys which intersect given interval
-     * @param {Interval} interval - search interval, or array [low, high]
+     * @param {Interval} interval - search interval, or tuple [low, high]
      * @param outputMapperFn(value,key) - optional function that maps (value, key) to custom output
      * @returns {Array}
      */
@@ -3365,6 +3365,17 @@ class IntervalTree {
         return resp_nodes.map(node => outputMapperFn(node.item.value, node.item.key))
     }
 
+    /**
+     * Returns true if intersection between given and any interval stored in the tree found
+     * @param {Interval} interval - search interval or tuple [low, high]
+     * @returns {boolean}
+     */
+    intersect_any(interval) {
+        let search_node = new Node(interval);
+        let found = this.tree_find_any_interval(this.root, search_node);
+        return found;
+    }
+
     /**
      * Tree visitor. For each node implement a callback function. <br/>
      * Method calls a callback function with two parameters (key, value)
@@ -3634,6 +3645,25 @@ class IntervalTree {
         }
     }
 
+    tree_find_any_interval(node, search_node) {
+        let found = false;
+        if (node != null && node != this.nil_node) {
+            // if (node->left != this.nil_node && node->left->max >= low) {
+            if (node.left != this.nil_node && !node.not_intersect_left_subtree(search_node)) {
+                found = this.tree_find_any_interval(node.left, search_node);
+            }
+            // if (low <= node->high && node->low <= high) {
+            if (!found) {
+                found = node.intersect(search_node);
+            }
+            // if (node->right != this.nil_node && node->low <= high) {
+            if (!found && node.right != this.nil_node && !node.not_intersect_right_subtree(search_node)) {
+                found = this.tree_find_any_interval(node.right, search_node);
+            }
+        }
+        return found;
+    }
+
     local_minimum(node) {
         let node_min = node;
         while (node_min.left != null && node_min.left != this.nil_node) {
@@ -5768,7 +5798,9 @@ class Arc {
 
     /**
      * Return new arc transformed using affine transformation matrix <br/>
-     * Note, that non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result
+     * Note 1. Non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result because
+     * it should create elliptic arc but library does not support ellipses
+     * Note 2. Mirror transformation (matrix[0] * matrix[3] < 0) change direction of the arc to the opposite
      * TODO: support non-equal scaling arc to ellipse or throw exception ?
      * @param {Matrix} matrix - affine transformation matrix
      * @returns {Arc}
@@ -5777,7 +5809,11 @@ class Arc {
         let newStart = this.start.transform(matrix);
         let newEnd = this.end.transform(matrix);
         let newCenter = this.pc.transform(matrix);
-        let arc = Flatten.Arc.arcSE(newCenter, newStart, newEnd, this.counterClockwise);
+        let newDirection = this.counterClockwise;
+        if (matrix.a * matrix.d < 0) {
+          newDirection = !newDirection;
+        }
+        let arc = Flatten.Arc.arcSE(newCenter, newStart, newEnd, newDirection);
         return arc;
     }
 
diff --git a/dist/main.esm.js b/dist/main.esm.js
index b4bb6b97..51796178 100644
--- a/dist/main.esm.js
+++ b/dist/main.esm.js
@@ -3350,7 +3350,7 @@ class IntervalTree {
     /**
      * Returns array of entry values which keys intersect with given interval <br/>
      * If no values stored in the tree, returns array of keys which intersect given interval
-     * @param {Interval} interval - search interval, or array [low, high]
+     * @param {Interval} interval - search interval, or tuple [low, high]
      * @param outputMapperFn(value,key) - optional function that maps (value, key) to custom output
      * @returns {Array}
      */
@@ -3361,6 +3361,17 @@ class IntervalTree {
         return resp_nodes.map(node => outputMapperFn(node.item.value, node.item.key))
     }
 
+    /**
+     * Returns true if intersection between given and any interval stored in the tree found
+     * @param {Interval} interval - search interval or tuple [low, high]
+     * @returns {boolean}
+     */
+    intersect_any(interval) {
+        let search_node = new Node(interval);
+        let found = this.tree_find_any_interval(this.root, search_node);
+        return found;
+    }
+
     /**
      * Tree visitor. For each node implement a callback function. <br/>
      * Method calls a callback function with two parameters (key, value)
@@ -3630,6 +3641,25 @@ class IntervalTree {
         }
     }
 
+    tree_find_any_interval(node, search_node) {
+        let found = false;
+        if (node != null && node != this.nil_node) {
+            // if (node->left != this.nil_node && node->left->max >= low) {
+            if (node.left != this.nil_node && !node.not_intersect_left_subtree(search_node)) {
+                found = this.tree_find_any_interval(node.left, search_node);
+            }
+            // if (low <= node->high && node->low <= high) {
+            if (!found) {
+                found = node.intersect(search_node);
+            }
+            // if (node->right != this.nil_node && node->low <= high) {
+            if (!found && node.right != this.nil_node && !node.not_intersect_right_subtree(search_node)) {
+                found = this.tree_find_any_interval(node.right, search_node);
+            }
+        }
+        return found;
+    }
+
     local_minimum(node) {
         let node_min = node;
         while (node_min.left != null && node_min.left != this.nil_node) {
@@ -5764,7 +5794,9 @@ class Arc {
 
     /**
      * Return new arc transformed using affine transformation matrix <br/>
-     * Note, that non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result
+     * Note 1. Non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result because
+     * it should create elliptic arc but library does not support ellipses
+     * Note 2. Mirror transformation (matrix[0] * matrix[3] < 0) change direction of the arc to the opposite
      * TODO: support non-equal scaling arc to ellipse or throw exception ?
      * @param {Matrix} matrix - affine transformation matrix
      * @returns {Arc}
@@ -5773,7 +5805,11 @@ class Arc {
         let newStart = this.start.transform(matrix);
         let newEnd = this.end.transform(matrix);
         let newCenter = this.pc.transform(matrix);
-        let arc = Flatten.Arc.arcSE(newCenter, newStart, newEnd, this.counterClockwise);
+        let newDirection = this.counterClockwise;
+        if (matrix.a * matrix.d < 0) {
+          newDirection = !newDirection;
+        }
+        let arc = Flatten.Arc.arcSE(newCenter, newStart, newEnd, newDirection);
         return arc;
     }
 
diff --git a/dist/main.umd.js b/dist/main.umd.js
index 1407c69c..52f80c94 100644
--- a/dist/main.umd.js
+++ b/dist/main.umd.js
@@ -3356,7 +3356,7 @@
         /**
          * Returns array of entry values which keys intersect with given interval <br/>
          * If no values stored in the tree, returns array of keys which intersect given interval
-         * @param {Interval} interval - search interval, or array [low, high]
+         * @param {Interval} interval - search interval, or tuple [low, high]
          * @param outputMapperFn(value,key) - optional function that maps (value, key) to custom output
          * @returns {Array}
          */
@@ -3367,6 +3367,17 @@
             return resp_nodes.map(node => outputMapperFn(node.item.value, node.item.key))
         }
 
+        /**
+         * Returns true if intersection between given and any interval stored in the tree found
+         * @param {Interval} interval - search interval or tuple [low, high]
+         * @returns {boolean}
+         */
+        intersect_any(interval) {
+            let search_node = new Node(interval);
+            let found = this.tree_find_any_interval(this.root, search_node);
+            return found;
+        }
+
         /**
          * Tree visitor. For each node implement a callback function. <br/>
          * Method calls a callback function with two parameters (key, value)
@@ -3636,6 +3647,25 @@
             }
         }
 
+        tree_find_any_interval(node, search_node) {
+            let found = false;
+            if (node != null && node != this.nil_node) {
+                // if (node->left != this.nil_node && node->left->max >= low) {
+                if (node.left != this.nil_node && !node.not_intersect_left_subtree(search_node)) {
+                    found = this.tree_find_any_interval(node.left, search_node);
+                }
+                // if (low <= node->high && node->low <= high) {
+                if (!found) {
+                    found = node.intersect(search_node);
+                }
+                // if (node->right != this.nil_node && node->low <= high) {
+                if (!found && node.right != this.nil_node && !node.not_intersect_right_subtree(search_node)) {
+                    found = this.tree_find_any_interval(node.right, search_node);
+                }
+            }
+            return found;
+        }
+
         local_minimum(node) {
             let node_min = node;
             while (node_min.left != null && node_min.left != this.nil_node) {
@@ -5770,7 +5800,9 @@
 
         /**
          * Return new arc transformed using affine transformation matrix <br/>
-         * Note, that non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result
+         * Note 1. Non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result because
+         * it should create elliptic arc but library does not support ellipses
+         * Note 2. Mirror transformation (matrix[0] * matrix[3] < 0) change direction of the arc to the opposite
          * TODO: support non-equal scaling arc to ellipse or throw exception ?
          * @param {Matrix} matrix - affine transformation matrix
          * @returns {Arc}
@@ -5779,7 +5811,11 @@
             let newStart = this.start.transform(matrix);
             let newEnd = this.end.transform(matrix);
             let newCenter = this.pc.transform(matrix);
-            let arc = Flatten.Arc.arcSE(newCenter, newStart, newEnd, this.counterClockwise);
+            let newDirection = this.counterClockwise;
+            if (matrix.a * matrix.d < 0) {
+              newDirection = !newDirection;
+            }
+            let arc = Flatten.Arc.arcSE(newCenter, newStart, newEnd, newDirection);
             return arc;
         }
 
diff --git a/package-lock.json b/package-lock.json
index 7427d896..73c9bb40 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -1,6 +1,6 @@
 {
   "name": "@flatten-js/core",
-  "version": "1.2.18",
+  "version": "1.2.22",
   "lockfileVersion": 1,
   "requires": true,
   "dependencies": {
@@ -1078,9 +1078,9 @@
       }
     },
     "@flatten-js/interval-tree": {
-      "version": "1.0.13",
-      "resolved": "https://registry.npmjs.org/@flatten-js/interval-tree/-/interval-tree-1.0.13.tgz",
-      "integrity": "sha512-5thHHdUZIRdPdEPx6G9tY6mHFMGoXsq9/ivemRszDcEkERXqlZAv+7NozaFbAUOvKXxyWoccSnLyjK0c5UWJeQ=="
+      "version": "1.0.14",
+      "resolved": "https://registry.npmjs.org/@flatten-js/interval-tree/-/interval-tree-1.0.14.tgz",
+      "integrity": "sha512-u7RFCMnrQb/fC6gIEXtfuqXFXN+yRDM+NSKZe0JECVyiDPTPqYDgkzvRHIX1NS1BxgK6BlZRLtPukAHoDJgGWg=="
     },
     "@istanbuljs/load-nyc-config": {
       "version": "1.1.0",
@@ -4009,7 +4009,7 @@
     "minimatch": {
       "version": "3.0.4",
       "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz",
-      "integrity": "sha1-UWbihkV/AzBgZL5Ul+jbsMPTIIM=",
+      "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==",
       "dev": true,
       "requires": {
         "brace-expansion": "^1.1.7"
diff --git a/package.json b/package.json
index c18191ce..c8a86afd 100644
--- a/package.json
+++ b/package.json
@@ -70,6 +70,6 @@
     "rollup-plugin-terser": "^5.1.3"
   },
   "dependencies": {
-    "@flatten-js/interval-tree": "^1.0.13"
+    "@flatten-js/interval-tree": "^1.0.14"
   }
 }
diff --git a/src/classes/arc.js b/src/classes/arc.js
index 2831fc89..cf75cf61 100644
--- a/src/classes/arc.js
+++ b/src/classes/arc.js
@@ -405,7 +405,9 @@ export class Arc {
 
     /**
      * Return new arc transformed using affine transformation matrix <br/>
-     * Note, that non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result
+     * Note 1. Non-equal scaling by x and y (matrix[0] != matrix[3]) produce illegal result because
+     * it should create elliptic arc but library does not support ellipses
+     * Note 2. Mirror transformation (matrix[0] * matrix[3] < 0) change direction of the arc to the opposite
      * TODO: support non-equal scaling arc to ellipse or throw exception ?
      * @param {Matrix} matrix - affine transformation matrix
      * @returns {Arc}