Login / Signup
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length.
Yan Gérard
Antoine Vacavant
Jean-Marie Favreau
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
quadtree
tight bounds
computational complexity
multiresolution
lossless compression
minimal length
database
data mining
data structure
digital libraries
high dimensional
multi dimensional
fractal image compression