You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I'm attempting to have polyfill return all hexagons intersected rather than just those hexagon's that have a center contained in the passed polygon.
It's been suggested that expanding the polygon by the average edge length of a hexagon at the target resolution is sufficient to ensure that the polygon is covered by polyfill. I've found that this isn't the case at various resolutions.
It seems that resolution 5 and expanding the polygon by the average hexagon edge length polyfill fails to find any intersecting hexagons.
By expanding by a factor of ~1.5 to 2 times the average hexagon length it seems that at all resolutions the polygon is completely covered. Is there a better procedure to follow for having polyfill return all intersecting hexagons?
The text was updated successfully, but these errors were encountered:
I'm attempting to have polyfill return all hexagons intersected rather than just those hexagon's that have a center contained in the passed polygon.
It's been suggested that expanding the polygon by the average edge length of a hexagon at the target resolution is sufficient to ensure that the polygon is covered by polyfill. I've found that this isn't the case at various resolutions.
Please see this notebook:
https://observablehq.com/@rustyconover/ensuring-h3-polyfill-returns-all-hexagons-for-a-polygon
It seems that resolution 5 and expanding the polygon by the average hexagon edge length polyfill fails to find any intersecting hexagons.
By expanding by a factor of ~1.5 to 2 times the average hexagon length it seems that at all resolutions the polygon is completely covered. Is there a better procedure to follow for having polyfill return all intersecting hexagons?
The text was updated successfully, but these errors were encountered: