@dra2020/baseclient 1.0.48 → 1.0.49

package/lib/poly/polylabel.ts

@@ -21,16 +21,66 @@ export function polyDistance(poly: any, x: number, y: number): number
   let pp = P.polyNormalize(poly);
   if (pp == null) return 0;
 
-  let forEachPointPair = (iter: any) => {
-      PP.polyPackEachRing(pp, (b: Float64Array, iPoly, iRing: number, iOffset: number, nPoints: number) => {
-          let iFirst = iOffset;
-          let iLast = iOffset + nPoints * 2;
-          let iSecond = iLast - 2;
-          for (; iFirst < iLast; iSecond = iFirst, iFirst += 2)
-            iter(iPoly, iRing, b[iFirst], b[iFirst+1], b[iSecond], b[iSecond+1]);
-        });
-    };
-  return pointToPolygonDist(x, y, forEachPointPair);
+  // First find if it is contained in one of the outer polygons, or outside all outer polygons
+  let iContaining = -1;
+  let maxOutside = - Infinity;
+  let minInside = Infinity;
+  let noholes = true;
+  PP.polyPackEachRing(pp, (b: Float64Array, iPoly: number, iRing: number, iOffset: number, nPoints: number) => {
+      // If we have determined we are inside this polygon, keep track of whether it has holes
+      if (iContaining == iPoly && iRing > 0)
+        noholes = false;
+      // Don't process rings
+      if (iRing > 0) return;
+      // OK, get distance
+      let forEachPointPair = (iter: any) => {
+          PP.polyPackEachRing(pp, (b: Float64Array, iInteriorPoly: number, iRing: number, iOffset: number, nPoints: number) => {
+              if (iRing || iInteriorPoly != iPoly) return;
+              let iFirst = iOffset;
+              let iLast = iOffset + nPoints * 2;
+              let iSecond = iLast - 2;
+              for (; iFirst < iLast; iSecond = iFirst, iFirst += 2)
+                iter(b[iFirst], b[iFirst+1], b[iSecond], b[iSecond+1]);
+            });
+        };
+      let dist = pointToPolygonDist(x, y, forEachPointPair);
+      // If inside, is it closest inside (deal with multipolygons that self-contain - think filled donut)
+      if (dist > 0 && dist < minInside)
+      {
+        iContaining = iPoly;
+        minInside = dist;
+        noholes = true;
+      }
+      else if (dist < 0)
+        maxOutside = Math.max(maxOutside, dist);
+    });
+  if (iContaining < 0)
+    return maxOutside;
+  if (noholes)
+    return minInside;
+
+  // OK, now need to worry about holes in the polygon it is contained in
+  PP.polyPackEachRing(pp, (b: Float64Array, iPoly: number, iRing: number, iOffset: number, nPoints: number) => {
+      // Only want to look at the holes for the containing polygon
+      if (iPoly != iContaining || iRing == 0) return;
+      // Compute distance to those holes
+      let forEachPointPair = (iter: any) => {
+          PP.polyPackEachRing(pp, (b: Float64Array, iInteriorPoly: number, iRing: number, iOffset: number, nPoints: number) => {
+              if (iInteriorPoly != iContaining || iRing == 0) return;
+              let iFirst = iOffset;
+              let iLast = iOffset + nPoints * 2;
+              let iSecond = iLast - 2;
+              for (; iFirst < iLast; iSecond = iFirst, iFirst += 2)
+                iter(b[iFirst], b[iFirst+1], b[iSecond], b[iSecond+1]);
+            });
+        };
+      // Negate distance since dealing with holes
+      let dist = - pointToPolygonDist(x, y, forEachPointPair);
+      // We take the min to either get a negative value (inside hole) or a smaller positive value
+      // (outside hole but close to hole boundary).
+      minInside = Math.min(minInside, dist);
+    });
+  return minInside;
 }
 
 //
@@ -69,7 +119,7 @@ export function polyLabel(poly: any, precision?: number, debug?: boolean): PolyL
           let iLast = iOffset + nPoints * 2;
           let iSecond = iLast - 2;
           for (; iFirst < iLast; iSecond = iFirst, iFirst += 2)
-            iter(iPoly, iRing, b[iFirst], b[iFirst+1], b[iSecond], b[iSecond+1]);
+            iter(b[iFirst], b[iFirst+1], b[iSecond], b[iSecond+1]);
         });
     };
 
@@ -164,38 +214,15 @@ class Cell
 // signed distance from point to polygon outline (negative if point is outside)
 function pointToPolygonDist(x: number, y: number, forEachPointPair: any): number
 {
-  let iPolyLast = -1;
-  let iRingLast = -1;
   let inside = false;
-  let thisInside = false;
-  let useInside = false;
-  let isHole = false;
-  let minDistSq: number = Infinity;
+  let minDistSq = Infinity;
 
-  forEachPointPair((iPoly: number, iRing: number, ax: number, ay: number, bx: number, by: number) => {
-      if (iPoly != iPolyLast || iRing != iRingLast)
-      {
-        if (useInside)
-          inside = isHole ? ! thisInside : thisInside;
-        iPolyLast = iPoly;
-        iRingLast = iRing;
-        thisInside = false;
-        useInside = false;
-        isHole = false;
-      }
+  forEachPointPair((ax: number, ay: number, bx: number, by: number) => {
       if ((ay > y !== by > y) && (x < (bx - ax) * (y - ay) / (by - ay) + ax))
-        thisInside = !thisInside;
+        inside = !inside;
 
-      let thisDistSq = getSegDistSq(x, y, ax, ay, bx, by);
-      if (thisDistSq < minDistSq)
-      {
-        minDistSq = thisDistSq;
-        useInside = true;
-        isHole = iRing != 0;
-      }
+      minDistSq = Math.min(minDistSq, getSegDistSq(x, y, ax, ay, bx, by));
     });
-  if (useInside)
-    inside = isHole ? ! thisInside : thisInside;
 
   return (inside ? 1 : -1) * Math.sqrt(minDistSq);
 }
@@ -209,7 +236,7 @@ function getCentroidCell(forEachPointPair: any): Cell
   let fx: number;
   let fy: number;
 
-  forEachPointPair((iPoly: number, iRing: number, ax: number, ay: number, bx: number, by: number) => {
+  forEachPointPair((ax: number, ay: number, bx: number, by: number) => {
       if (fx === undefined) fx = ax, fy = ay;
       let f: number = ax * by - bx * ay;
       x += (ax + bx) * f;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dra2020/baseclient",
-  "version": "1.0.48",
+  "version": "1.0.49",
   "description": "Utility functions for Javascript projects.",
   "main": "dist/baseclient.js",
   "types": "./dist/all/all.d.ts",