Hacker News new | ask | show | jobs
by samirahmed 1731 days ago
One example I am trying to wrap my head around is if you have two adjacent polygons (say California and Oregon) and perform an interior cover of both with variable hex sizes.

It seems possible that a child hex might actually slip outside the boundary - since the 7 children don't fit squarely inside the parent (no pun intended).

In S2 it guaranteed that any child cell of the S2CellUnion representing that cover is strictly inside the polygon bounds.

This doesn't seem to be guaranteed in H3. I could have a location that is in Oregon, that depending on the child resolution could slip into to Oregon instead of California - or vice versa?

Now imagine an business application where a user must be mapped to one of 2 physically exclusive regions, (for say pricing, legal, compliance reasons) it seems like exact containment is preferred.

Perhaps there is another way to employ H3 that would mitigate this?