On the size of quadtrees generalized to d-dimensional binary pictures
From MaRDI portal
Recommendations
Cites work
- An effective way to represent quadtrees
- Counting regions, holes, and their nesting level in time proportional to the border
- Determination of the 3D border by repeated elimination of internal surfaces
- Linear quadtrees: A blocking technique for contour filling
- On a Method of Binary-Picture Representation and Its Application to Data Compression
- Operations on Quadtree Encoded Images
- Properties and applications of forests of quadtrees for pictorial data representation
- Set operations on linear quadtrees
- The space efficiency of quadtrees
Cited in
(14)- Linear hypertree for multi-dimensional image representation
- Combinatorial variations on multidimensional quadtrees
- Incremental bit-quads count in tree of shapes
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
- Quadtrees as an abstract domain
- QUADTREES, MANDELBROT PERCOLATION AND THE MODELLING OF RANDOM SETS
- Expected and worst-case storage requirements for quadtrees
- The space efficiency of quadtrees
- The Use of Linear Quadtrees in a Numerical Problem
- scientific article; zbMATH DE number 536558 (Why is no real title available?)
- scientific article; zbMATH DE number 4114092 (Why is no real title available?)
- A generalized solution to the quadtree expected complexity problem
- Efficient Coding of Quadtree Nodes
- Constraining Images of Quadratic Arboreal Representations
This page was built for publication: On the size of quadtrees generalized to d-dimensional binary pictures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065557)