David Ellis

Looks like a 2-3x speedup. Very cool. :) @joegilley it looks like you have a target. ;) @nmandery we have known that the current polyfill algorithm is suboptimal -- it...

> > There was a much better polyfill algorithm implemented in a prototype a few years ago (by @joegilley :) ), and with @nrabinowitz having implemented a line algorithm a...

@nmandery your use-case is totally valid and we should try to support it! I'm just trying to bring up as many issues and alternatives as possible so the final result...

@isaacbrodsky does that mean the focus will be on implementing the improved polyfill algo to get a similar speedup in a single core?

Lots of potential shorthand names come up in my mind: `c` for coordinate, `m` for mercator, `p` for point, `l` for location. Fully generic names like `a` or `x` for...

Also a +1 for `LatLng` (camelCase 4ever!). As for `Lng` vs `Lon` I personally prefer `Lng`. Implicit vowels works well enough that some languages are based on it. ;) While...

BTW, if you want to do data analysis on Starlink's data, you can polyfill their hexagons with a much finer H3 grid and continue from there, though it will still...

I have one more proposed H3 distance function: `h3KDistance`. And I think I finally have an algorithm for this "grail." :) Think of this: Two hexagons that are neighbors have...

Hi @sahrk :) To be honest I'm not sure if we're talking about the same thing. I'm referring to the minimum number of hexagons needed to be crossed ("k"rossed?) to...

I don't really like the idea of statically linking Musl to support one uncommon Linux variant. If we're going to support this, I'd rather we do some autoconf-like detection of...