Hexbin some data about h3

[dfellis]

If I've got your question right, I think you want to use the polyfill function (along with the maxPolyfillSize function to allocate the required memory). It takes a GeoJSON-like struct defining the area to fill, and it guarantees perfectly contiguous geometries have no overlapping hexagons (though the hexagons themselves may overlap the geometries, each overlapping hexagon will be in one or the other geofence, never both).

The bindings (that @isaacbrodsky is working on getting open sourced hopefully this month) handled the GeoJSON to GeoJSON-like struct conversion for you.

After that, you would just take the value for the zip code geofence and divide it equally amongst the hexagons in the polyfilled zip code hexagon array.

(EDIT: Hopefully the docs are pushed up soon so I don't have to link to source code directly for long. :) Also "polyfill" in this case is short for "polygon fill", and not the kind of polyfill common in Javascript.)

[jogly]

+1 to @dfellis 's answer. only caveat i can see is for his solution alone, there isn't any weighted distribution possible for hexagons that have geometry overlapping a polygon boundary because they'll be assigned one side or another, like he said.

so for the portion of your question "taking into account degree of overlapping", you might have to implement post-processing with a degree of sophistication appropriate for your use case.

depending on your use case, you could avoid that by using sufficiently high resolution hexagon cells and stick with @dfellis's solution :)

[nrabinowitz]

Closing this as resolved, please reopen if the answers here have any issues.