Hacker News Reader

Oh yes, quadtree-like structures come up all the time when you're dealing with maps. E.g. check out this algorithm I came up with for finding pole of inaccessibility of a polygon: https://github.com/mapbox/polylabel

polylabel looks great, thank you

Hey mourner, didn't know you're on HN. Just wanted to say thanks for all the great work on mapbox-gl and the side libraries you've released!

Thank you!

I guess you refer to the in computer graphics commonly applied concept of Level of Detail(LOD)?

https://en.m.wikipedia.org/wiki/Level_of_detail

Did my masters project on quadtrees, specifically distributed methods for solving differential equations. Using them for mapping and loading adjacent cells is a similar application, as a lot of my work was in trying to maintain locality when flattening the structure. I had a great time writing this up, they're fantastic structures with a lot of potential.

https://github.com/MattDiesel/tftt/releases/tag/1.2