Skip to content

Hexbin some data #27

@nlassaux

Description

@nlassaux

Knowing the complexity of the library, what do you think would be the efficient way to aggregate data from polygons into hexagonal shapes, taking into account the degree of overlapping?

For example, translating:

Zip code Count
10001 10
10002 3
10003 14

into:

Hash Count
8a2a1072b59ffff 3
8a2a1072b59ffee 5
8a2a1072b59ffdd 3
8a2a1072b59ffcc 2
8a2a1072b59ffbb 2

h3ToGeoBoundary could be used, and then classic methods to compute the overlap between each shape. But the complexity looks pretty high for that.

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions