The following pages link to Faster compressed quadtrees (Q2084740):
Displaying 10 items.
- Entropy-bounded representation of point grids (Q390358) (← links)
- \(L\) curve for spherical triangle region quadtrees (Q866331) (← links)
- An optimal algorithm for decomposing a window into maximal quadtree blocks (Q1306567) (← links)
- Analysis of the worst case space complexity of a PR quadtree (Q1318753) (← links)
- GraCT: a grammar-based compressed index for trajectory data (Q2212550) (← links)
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767) (← links)
- A generalized comparison of linear representations of thematic layers (Q2734626) (← links)
- Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes (Q2912856) (← links)
- Dynamic smooth compressed quadtrees (Q5115813) (← links)
- Evaluating regular path queries on compressed adjacency matrices (Q6545410) (← links)