The space efficiency of quadtrees
From MaRDI portal
Recommendations
- On the size of quadtrees generalized to d-dimensional binary pictures
- Expected and worst-case storage requirements for quadtrees
- scientific article; zbMATH DE number 794266
- A generalized solution to the quadtree expected complexity problem
- Analysis of the worst case space complexity of a PR quadtree
Cited in
(19)- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
- Normalized quadtrees with respect to translations
- On the size of quadtrees generalized to d-dimensional binary pictures
- Analysis of the worst case space complexity of a PR quadtree
- An algorithm for evaluating the thermogram heterogeneity based on its quadtree representation
- L curve for spherical triangle region quadtrees
- The Use of Linear Quadtrees in a Numerical Problem
- scientific article; zbMATH DE number 794266 (Why is no real title available?)
- QUADTREES, MANDELBROT PERCOLATION AND THE MODELLING OF RANDOM SETS
- Decomposing a window into maximal quadtree blocks
- Efficient Coding of Quadtree Nodes
- Quadtrees as an abstract domain
- The skip quadtree
- Linear-time border-tracing algorithms for quadtrees
- Expected and worst-case storage requirements for quadtrees
- Page usage in a quadtree index
- Faster compressed quadtrees
- An optimal boundary to quadtree conversion algorithm
This page was built for publication: The space efficiency of quadtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313295)
