An optimal algorithm for decomposing a window into maximal quadtree blocks

DOI10.1007/S002360050160zbMath0940.68030OpenAlexW2076399175MaRDI QIDQ1306567

Guido Proietti

Publication date: 9 November 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050160

zbMATH Keywords

quadtree based data structures

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (2)

Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query ⋮ Space-efficient representations of raster time series

This page was built for publication: An optimal algorithm for decomposing a window into maximal quadtree blocks