Faster compressed quadtrees

DOI10.1016/j.jcss.2022.09.001OpenAlexW2950688144MaRDI QIDQ2084740

Susana Ladra, Travis Gagie, Guillermo de Bernardo, Gonzalo Navarro, Diego Seco

Publication date: 13 October 2022

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.2785

zbMATH Keywords

quadtreesheavy-path decompositionrange queriescompact data structuresclustered points

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• A data structure for dynamic trees
• Foundations of multidimensional and metric data structures.
• A practical succinct dynamic graph representation
• Fully Functional Static and Dynamic Succinct Trees
• Fast Compressed Tries through Path Decompositions
• Time-space trade-offs for predecessor search
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• An effective way to represent quadtrees
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Practical Entropy-Compressed Rank/Select Dictionary
• Quad-K-d Trees

This page was built for publication: Faster compressed quadtrees