dgeoutils 2.4.38 → 2.4.40

package/README.md

@@ -19,7 +19,7 @@
 [ESLint Report](https://edejin.github.io/DGeoUtils/media/eslit.html)
 
 ```html
-  <script src="https://unpkg.com/jsts@latest/dist/jsts.js"></script>
+  <script src="https://unpkg.com/jsts@2.7.1/dist/jsts.js"></script>
   <script src="https://unpkg.com/dgeoutils@latest/dist/umd/dgeoutils.js"></script>
 ```
 

package/dist/cjs/DPolygon.d.ts

@@ -30,6 +30,7 @@ export declare class DPolygon {
     get minX(): number;
     get maxY(): number;
     get minY(): number;
+    get innerCenter(): DPoint;
     get center(): DPoint;
     get h(): number;
     get w(): number;

package/dist/cjs/DPolygon.js

@@ -87,6 +87,12 @@ exports.MIN_POINTS_IN_VALID_POLYGON = 3;
 var APPROXIMATION_VALUE = 0.1;
 var MAX_CONVEX_ITERATIONS = 100;
 var CLOSE_TO_INTERSECTION_DISTANCE = 0.001;
+var triangleCenter = function (triangle) {
+    var p0 = triangle.at(0);
+    var p1 = triangle.at(1);
+    var p2 = triangle.at(2);
+    return new DPoint_1.DPoint((p0.x + p1.x + p2.x) / 3, (p0.y + p1.y + p2.y) / 3);
+};
 var containCalculator = function (poly, p) {
     var e_1, _a, e_2, _b;
     var hasSamePoint = poly.points.some(function (point) { return point.equal(p); });
@@ -275,6 +281,19 @@ var DPolygon = (function () {
         enumerable: false,
         configurable: true
     });
+    Object.defineProperty(DPolygon.prototype, "innerCenter", {
+        get: function () {
+            var center = this.center;
+            return this.toTriangles().map(function (t) {
+                var c = triangleCenter(t);
+                c.properties.score = Math.min(c.distance(t.at(0)), c.distance(t.at(1)), c.distance(t.at(2))) + c.distance(center);
+                return c;
+            })
+                .sort(function (a, b) { return a.properties.score - b.properties.score; })[0];
+        },
+        enumerable: false,
+        configurable: true
+    });
     Object.defineProperty(DPolygon.prototype, "center", {
         get: function () {
             return this.leftTop.move(this.size.divide(2));
@@ -1278,6 +1297,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;
@@ -1305,7 +1332,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

@@ -10,6 +10,12 @@ export const MIN_POINTS_IN_VALID_POLYGON = 3;
 const APPROXIMATION_VALUE = 0.1;
 const MAX_CONVEX_ITERATIONS = 100;
 const CLOSE_TO_INTERSECTION_DISTANCE = 0.001;
+const triangleCenter = (triangle) => {
+    const p0 = triangle.at(0);
+    const p1 = triangle.at(1);
+    const p2 = triangle.at(2);
+    return new DPoint((p0.x + p1.x + p2.x) / 3, (p0.y + p1.y + p2.y) / 3);
+};
 const containCalculator = (poly, p) => {
     const hasSamePoint = poly.points.some((point) => point.equal(p));
     if (hasSamePoint) {
@@ -145,6 +151,15 @@ export class DPolygon {
     get minY() {
         return this.reduce((a, r) => Math.min(a, r.y), Infinity);
     }
+    get innerCenter() {
+        const { center } = this;
+        return this.toTriangles().map((t) => {
+            const c = triangleCenter(t);
+            c.properties.score = Math.min(c.distance(t.at(0)), c.distance(t.at(1)), c.distance(t.at(2))) + c.distance(center);
+            return c;
+        })
+            .sort((a, b) => a.properties.score - b.properties.score)[0];
+    }
     get center() {
         return this.leftTop.move(this.size.divide(2));
     }
@@ -829,6 +844,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;
@@ -856,7 +879,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

@@ -84,6 +84,12 @@ export var MIN_POINTS_IN_VALID_POLYGON = 3;
 var APPROXIMATION_VALUE = 0.1;
 var MAX_CONVEX_ITERATIONS = 100;
 var CLOSE_TO_INTERSECTION_DISTANCE = 0.001;
+var triangleCenter = function (triangle) {
+    var p0 = triangle.at(0);
+    var p1 = triangle.at(1);
+    var p2 = triangle.at(2);
+    return new DPoint((p0.x + p1.x + p2.x) / 3, (p0.y + p1.y + p2.y) / 3);
+};
 var containCalculator = function (poly, p) {
     var e_1, _a, e_2, _b;
     var hasSamePoint = poly.points.some(function (point) { return point.equal(p); });
@@ -272,6 +278,19 @@ var DPolygon = (function () {
         enumerable: false,
         configurable: true
     });
+    Object.defineProperty(DPolygon.prototype, "innerCenter", {
+        get: function () {
+            var center = this.center;
+            return this.toTriangles().map(function (t) {
+                var c = triangleCenter(t);
+                c.properties.score = Math.min(c.distance(t.at(0)), c.distance(t.at(1)), c.distance(t.at(2))) + c.distance(center);
+                return c;
+            })
+                .sort(function (a, b) { return a.properties.score - b.properties.score; })[0];
+        },
+        enumerable: false,
+        configurable: true
+    });
     Object.defineProperty(DPolygon.prototype, "center", {
         get: function () {
             return this.leftTop.move(this.size.divide(2));
@@ -1275,6 +1294,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;
@@ -1302,7 +1329,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()