@dra2020/baseclient 1.0.28 → 1.0.29

package/dist/poly/all.d.ts

@@ -14,3 +14,4 @@ export * from './topo';
 export * from './selfintersect';
 export * from './shamos';
 export * from './pointinpoly';
+export * from './mapto';

package/dist/poly/mapto.d.ts

@@ -0,0 +1,2 @@
+import * as G from '../geo/all';
+export declare function polyMapTo(districts: G.GeoFeatureCollection, blocks: G.GeoFeatureCollection): any;

package/lib/poly/all.ts

@@ -14,3 +14,4 @@ export * from './topo';
 export * from './selfintersect';
 export * from './shamos';
 export * from './pointinpoly';
+export * from './mapto';

package/lib/poly/mapto.ts

@@ -0,0 +1,64 @@
+import * as G from '../geo/all';
+import * as P from './poly';
+import * as PP  from './polypack';
+import * as PL from './polylabel';
+import * as BB from './boundbox';
+import { polyContainsPoint } from './pointinpoly';
+
+function setLabels(c: G.GeoFeatureCollection): void
+{
+  c.features.forEach(f => {
+      if (f.properties.labelx === undefined)
+      {
+        let {x,y} = PL.polyLabel(f);
+        f.properties.labelx = x;
+        f.properties.labely = y;
+      }
+    });
+}
+
+// polyMapTo:
+//
+//  Given a set of underlying blocks (or precincts), map them to the district (or any other feature)
+//  they are contained in.
+//
+//  If a block maps to multiple districts or no district, it is left out of the result.
+//
+//  Note that the algorithm is to see where the centroid of the block overlaps. So a block
+//  could potentially overlap multiple districts and this would return only the one containing
+//  the centroid.
+//
+//  The thinking is that if you want fine granularity, use real blocks as the base collection.
+//  If you provide precincts, you will get a result on precinct granularity.
+//
+//  The return value is an object that maps the block feature ids to the district feature id.
+//
+
+export function polyMapTo(districts: G.GeoFeatureCollection, blocks: G.GeoFeatureCollection): any
+{
+  let map: any = {};
+
+  // Cache labelx, labely if necessary
+  setLabels(blocks);
+
+  // Cache district boundboxes for quick containment exclusion
+  let bbDistricts: BB.BoundBox[] = districts.features.map(f => BB.boundbox(f));
+
+  // Walk over blocks, mapping centroid to district
+  blocks.features.forEach(fBlock => {
+      let x = fBlock.properties.labelx;
+      let y = fBlock.properties.labely;
+
+      let fIn: G.GeoFeature[] = [];
+      districts.features.forEach((fDistrict: G.GeoFeature, i: number) => {
+          if (BB.boundboxContains(bbDistricts[i], x, y))
+            if (polyContainsPoint(fDistrict, x, y))
+              fIn.push(fDistrict);
+        });
+
+      if (fIn.length == 1)
+        map[fBlock.properties.id] = fIn[0].properties.id;
+    });
+
+  return map;
+}

package/package.json

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