Faster compressed quadtrees
From MaRDI portal
Publication:2084740
DOI10.1016/J.JCSS.2022.09.001OpenAlexW2950688144MaRDI QIDQ2084740FDOQ2084740
Authors: Guillermo de Bernardo, Travis Gagie, Susana Ladra, 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
Recommendations
Cites Work
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- A data structure for dynamic trees
- Foundations of multidimensional and metric data structures.
- Fully functional static and dynamic succinct trees
- Time-space trade-offs for predecessor search
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- Practical entropy-compressed rank/select dictionary
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- An effective way to represent quadtrees
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Fast compressed tries through path decompositions
- Quad-\(K\)-d trees
- Title not available (Why is that?)
- A practical succinct dynamic graph representation
Cited In (18)
- GraCT: a grammar-based compressed index for trajectory data
- How to efficiently generate PNR representation of a qualitative geofield
- Fringed-quadtrees: a new kind of data structure
- Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
- Compressed data structures for range searching
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
- Analysis of the worst case space complexity of a PR quadtree
- \(L\) curve for spherical triangle region quadtrees
- Simple and Efficient Traversal Methods for Quadtrees and Octrees
- Title not available (Why is that?)
- Dynamic smooth compressed quadtrees
- Efficient Coding of Quadtree Nodes
- A generalized comparison of linear representations of thematic layers
- SP-quadtree: an approach of data structuring for parallelization of spatial data
- Quadtree representation and compression of spatial data
- Evaluating regular path queries on compressed adjacency matrices
- Entropy-bounded representation of point grids
- Entropy-bounded representation of point grids
This page was built for publication: Faster compressed quadtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084740)
