Open daniel-j-h opened 3 years ago
We need a succinct trie to compress a hierarchy of cells where we cover graph nodes based on their location.
The cells could then look like quadkeys, recursively dividing the space.
Neighboring cells
and their parent cell 12023.
With a succinct tree we can efficiently store this hierarchy in a compact way.
See https://labs.mapbox.com/what-the-tile/
Here is a good introduction http://stevehanov.ca/blog/?id=120
Depends on rank/select for trie traversal
Fast Compressed Tries through Path Decompositions could be interesting
We need a succinct trie to compress a hierarchy of cells where we cover graph nodes based on their location.
The cells could then look like quadkeys, recursively dividing the space.
Neighboring cells
and their parent cell 12023.
With a succinct tree we can efficiently store this hierarchy in a compact way.
See https://labs.mapbox.com/what-the-tile/
Here is a good introduction http://stevehanov.ca/blog/?id=120
Depends on rank/select for trie traversal