Decomposing a window into maximal quadtree blocks

DOI10.1007/BF01210594MaRDI QIDQ1323351zbMATH OpenOpenAlexFDO

Authors Walid G. Aref, Hanan Samet

Publication date 10 May 1994

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

quadtree decompositionquery answering algorithmspatial databasewindow-based queries

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Recommendations

• An optimal algorithm for decomposing a window into maximal quadtree blocks
• scientific article; zbMATH DE number 1869802
• Space-filling approach for fast window query on compressed images
• SP-quadtree: an approach of data structuring for parallelization of spatial data

Cites work

• scientific article; zbMATH DE number 3415422 (Why is no real title available?)
• Ignoring ignorance and agreeing to disagree
• The space efficiency of quadtrees

Cited in

(5)

• An optimal algorithm for decomposing a window into maximal quadtree blocks
• Space-filling approach for fast window query on compressed images
• scientific article; zbMATH DE number 1834541 (Why is no real title available?)
• scientific article; zbMATH DE number 1869802 (Why is no real title available?)
• Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

This page was built for publication: 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 Q1323351)