6 ms·
Very cool. Seems to have some striking similarity to the quadtree map used for efficient position querying of variably complicated areas. https://en.m.wikipedi
by throwaway13337 7y ago
Very cool. Seems to have some striking similarity to the quadtree map used for efficient position querying of variably complicated areas.
https://en.m.wikipedia.org/wiki/Quadtree https://en.m.wikipedia.org/wiki/Quadtree
- Lindenmayer 7y agoI 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 https://en.m.wikipedia.org/wiki/Level_of_detail
- mdiesel 7y agoDid 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 https://github.com/MattDiesel/tftt/releases/tag/1.2
- mourner 7y agoOh 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 https://github.com/mapbox/polylabel