uber / uber/h3

Distance matrix between two set of hex IDs

Open
#435 0 comments 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
C
Stars
6.5k
Forks
627
Avg merge
3d 21h
Merged PRs (30d)
6

Description

Would be useful to have a function that calculates matrix distance between two sets of hex IDs. Currently, I loop through the lists and use the h3_distance function to calculate the distance between pairs of hex IDs at a time.

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by locating the existing h3_distance entry point and its public API and tests. Trace how distance calculations are exposed, then define the matrix behavior for the two input sets and verify the resulting pairwise distances with coverage for representative inputs.

Written by the indexing model from the issue text.

Assessment

Tech stack
c
Domain
api
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.