An optimal algorithm for decomposing a window into maximal quadtree blocks

DOI10.1007/S002360050160zbMATH Open0940.68030OpenAlexW2076399175MaRDI QIDQ1306567FDOQ1306567

Authors: 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

Recommendations

• Decomposing a window into maximal quadtree blocks
• scientific article; zbMATH DE number 1869802
• An optimal boundary to quadtree conversion algorithm
• Space-filling approach for fast window query on compressed images

zbMATH Keywords

quadtree based data structures

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (5)

• Title not available (Why is that?)
• Optimal window queries on line segments using the trapezoidal search DAG
• Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query
• Space-efficient representations of raster time series
• Space-filling approach for fast window query on compressed images

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306567)