dgeoutils 2.4.39 → 2.4.41

package/dist/cjs/DPolygon.d.ts

@@ -46,6 +46,7 @@ export declare class DPolygon {
     get fullLength(): number;
     get perimeter(): number;
     get area(): number;
+    get filledDeintersection(): DPolygon;
     get deintersection(): DPolygon;
     get valid(): boolean;
     get first(): DPoint;

package/dist/cjs/DPolygon.js

@@ -439,6 +439,40 @@ var DPolygon = (function () {
         enumerable: false,
         configurable: true
     });
+    Object.defineProperty(DPolygon.prototype, "filledDeintersection", {
+        get: function () {
+            var p = this.clone().deintersection.removeDuplicates().clockWise.open();
+            var findSameCorners = function (startIndex) {
+                if (startIndex === void 0) { startIndex = 0; }
+                var store = {};
+                for (var i = startIndex; i < p.length; i++) {
+                    var key = p.at(i).toString();
+                    if (typeof store[key] === 'number') {
+                        return [store[key], i];
+                    }
+                    store[key] = i;
+                }
+                return undefined;
+            };
+            var indexes = findSameCorners();
+            var holes = [];
+            while (indexes) {
+                var a = new DPolygon(p.clone().removePart(indexes[0], indexes[1] - indexes[0]));
+                if (a.isClockwise) {
+                    indexes = findSameCorners(indexes[0] + 1);
+                }
+                else {
+                    holes.push(a.close());
+                    p.removePart(indexes[0], indexes[1] - indexes[0]);
+                    indexes = findSameCorners();
+                }
+            }
+            p.holes = holes;
+            return p.close();
+        },
+        enumerable: false,
+        configurable: true
+    });
     Object.defineProperty(DPolygon.prototype, "deintersection", {
         get: function () {
             var e_6, _a;
@@ -1297,6 +1331,14 @@ var DPolygon = (function () {
         return res;
     };
     DPolygon.prototype.toTriangles = function () {
+        var q = this.clone().removeDuplicates()
+            .open();
+        if (q.length < 3) {
+            return [];
+        }
+        if (q.length === 3) {
+            return [q];
+        }
         var innerAndNotIntersect = function (poly, p1, p2) {
             var l = p1.findLine(p2);
             var center = l.center;
@@ -1324,7 +1366,7 @@ var DPolygon = (function () {
             }
             return undefined;
         };
-        var p = this.clone().clockWise.open();
+        var p = this.clone().removeDuplicates().clockWise.open();
         while (p.holes.length) {
             var h = p.holes.shift()
                 .clone()

package/dist/es2015/DPolygon.js

@@ -223,6 +223,35 @@ export class DPolygon {
         }
         return Math.abs(sum / 2) - this.holes.reduce((a, hole) => a + hole.area, 0);
     }
+    get filledDeintersection() {
+        const p = this.clone().deintersection.removeDuplicates().clockWise.open();
+        const findSameCorners = (startIndex = 0) => {
+            const store = {};
+            for (let i = startIndex; i < p.length; i++) {
+                const key = p.at(i).toString();
+                if (typeof store[key] === 'number') {
+                    return [store[key], i];
+                }
+                store[key] = i;
+            }
+            return undefined;
+        };
+        let indexes = findSameCorners();
+        const holes = [];
+        while (indexes) {
+            const a = new DPolygon(p.clone().removePart(indexes[0], indexes[1] - indexes[0]));
+            if (a.isClockwise) {
+                indexes = findSameCorners(indexes[0] + 1);
+            }
+            else {
+                holes.push(a.close());
+                p.removePart(indexes[0], indexes[1] - indexes[0]);
+                indexes = findSameCorners();
+            }
+        }
+        p.holes = holes;
+        return p.close();
+    }
     get deintersection() {
         let p = this.clone().close();
         const store = {};
@@ -844,6 +873,14 @@ export class DPolygon {
         return res;
     }
     toTriangles() {
+        const q = this.clone().removeDuplicates()
+            .open();
+        if (q.length < 3) {
+            return [];
+        }
+        if (q.length === 3) {
+            return [q];
+        }
         const innerAndNotIntersect = (poly, p1, p2) => {
             const l = p1.findLine(p2);
             const { center } = l;
@@ -871,7 +908,7 @@ export class DPolygon {
             }
             return undefined;
         };
-        const p = this.clone().clockWise.open();
+        const p = this.clone().removeDuplicates().clockWise.open();
         while (p.holes.length) {
             const h = p.holes.shift()
                 .clone()

package/dist/esm/DPolygon.js

@@ -436,6 +436,40 @@ var DPolygon = (function () {
         enumerable: false,
         configurable: true
     });
+    Object.defineProperty(DPolygon.prototype, "filledDeintersection", {
+        get: function () {
+            var p = this.clone().deintersection.removeDuplicates().clockWise.open();
+            var findSameCorners = function (startIndex) {
+                if (startIndex === void 0) { startIndex = 0; }
+                var store = {};
+                for (var i = startIndex; i < p.length; i++) {
+                    var key = p.at(i).toString();
+                    if (typeof store[key] === 'number') {
+                        return [store[key], i];
+                    }
+                    store[key] = i;
+                }
+                return undefined;
+            };
+            var indexes = findSameCorners();
+            var holes = [];
+            while (indexes) {
+                var a = new DPolygon(p.clone().removePart(indexes[0], indexes[1] - indexes[0]));
+                if (a.isClockwise) {
+                    indexes = findSameCorners(indexes[0] + 1);
+                }
+                else {
+                    holes.push(a.close());
+                    p.removePart(indexes[0], indexes[1] - indexes[0]);
+                    indexes = findSameCorners();
+                }
+            }
+            p.holes = holes;
+            return p.close();
+        },
+        enumerable: false,
+        configurable: true
+    });
     Object.defineProperty(DPolygon.prototype, "deintersection", {
         get: function () {
             var e_6, _a;
@@ -1294,6 +1328,14 @@ var DPolygon = (function () {
         return res;
     };
     DPolygon.prototype.toTriangles = function () {
+        var q = this.clone().removeDuplicates()
+            .open();
+        if (q.length < 3) {
+            return [];
+        }
+        if (q.length === 3) {
+            return [q];
+        }
         var innerAndNotIntersect = function (poly, p1, p2) {
             var l = p1.findLine(p2);
             var center = l.center;
@@ -1321,7 +1363,7 @@ var DPolygon = (function () {
             }
             return undefined;
         };
-        var p = this.clone().clockWise.open();
+        var p = this.clone().removeDuplicates().clockWise.open();
         while (p.holes.length) {
             var h = p.holes.shift()
                 .clone()