uber / uber/h3

getNearestEdge( Position )

Open
#758 1 comment 0 reactions 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

It would be interesting to give/enter a point, either in x,y,z or lat, long coordinates...

The library would then compute the cell index and maybe cell center.

And then the library would compute which edge is nearest to this point.

The edge could then be a number 0 to 5 or so... indicating which edge in a clock wise direction.

Alternatively it could be some edge index number... but preferably some number 0 to 5 for me at least, for coloring purposes...

(In general I think this library could benefit from all kinds of distance computation functions, for visualization purposes, see distance field rendering).

(But also ordering of the geometry and applieing some kind of order to the phenomenon like edges and verteces but at a local ordering scheme).

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

No file, test, or entry point is named. Start by clarifying whether input should be x,y,z or latitude/longitude, how the cell and nearest edge are selected, and whether the result is a local edge number or an edge index. Done would require an agreed API and tests covering the specified coordinate and edge behavior.

Written by the indexing model from the issue text.

Assessment

Tech stack
c
Domain
backend
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.