dgeoutils 2.2.5 → 2.2.6

package/dist/DPolygon.d.ts

@@ -182,7 +182,8 @@ export declare class DPolygon {
      * @param f
      */
     filter(f: (p: DPoint) => boolean): DPolygon;
-    map(f: (r: DPoint, index?: number) => DPoint): DPolygon;
+    map(f: (r: DPoint) => DPoint): DPolygon;
+    map(f: (r: DPoint, index: number) => DPoint): DPolygon;
     at(index: number): DPoint;
     pop(): DPoint;
     push(...args: DPoint[]): number;
@@ -298,6 +299,10 @@ export declare class DPolygon {
      * ![Example](https://edejin.github.io/DGeoUtils/media/examples/toTriangles.png)
      */
     toTriangles(): DPolygon[];
+    /**
+     * Divide polygon to triangles and return points indexes
+     */
+    getTrianglesPointIndexes(): number[];
     get closed(): boolean;
     /**
      * @param v

package/dist/DPolygon.js

@@ -904,6 +904,72 @@ class DPolygon {
         res.push(p);
         return res;
     }
+    /**
+     * Divide polygon to triangles and return points indexes
+     */
+    getTrianglesPointIndexes() {
+        const innerAndNotIntersect = (poly, p1, p2) => {
+            const l = p1.findLine(p2);
+            const { center } = l;
+            const intersections = poly.holes.reduce((a, hole) => a && Boolean(hole.clone().close()
+                .intersection(l, true).length), Boolean(poly.clone().close()
+                .intersection(l, true).length));
+            const contain = poly.holes.reduce((a, hole) => a && !hole
+                .contain(center), poly.contain(center));
+            return !intersections && contain;
+        };
+        const getTriangle = (poly) => {
+            for (let i = 0; i < poly.length; i++) {
+                const p0 = poly.at(0);
+                const p1 = poly.at(1);
+                const p2 = poly.at(2);
+                if (innerAndNotIntersect(poly, p0, p2)) {
+                    poly.removePart(0, 1);
+                    return [
+                        p0.properties.index,
+                        p1.properties.index,
+                        p2.properties.index
+                    ];
+                }
+                poly.push(poly.shift());
+            }
+            return undefined;
+        };
+        let p = this.clone();
+        let index = 0;
+        p.points.forEach((f) => {
+            f.properties.index = index++;
+        });
+        p.holes.forEach((h) => {
+            h.pPoints.forEach((f) => {
+                f.properties.index = index++;
+            });
+        });
+        p = p.clockWise.open();
+        while (p.holes.length) {
+            const h = p.holes.shift()
+                .clone()
+                .clockWise
+                .reverse()
+                .close();
+            for (let i = 0; i < p.length; i++) {
+                if (innerAndNotIntersect(p, p.first, h.first)) {
+                    p.insertAfter(0, ...h.points, p.first);
+                    break;
+                }
+                p.push(p.shift());
+            }
+        }
+        const res = [];
+        while (p.length > 3) {
+            const triangle = getTriangle(p);
+            if (triangle) {
+                res.push(...triangle);
+            }
+        }
+        res.push(...p.points.map((f) => f.properties.index));
+        return res;
+    }
     get closed() {
         return this.first.equal(this.last);
     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dgeoutils",
-  "version": "2.2.5",
+  "version": "2.2.6",
   "description": "",
   "scripts": {
     "build": "node_modules/.bin/tsc",