Decomposing a window into maximal quadtree blocks

DOI10.1007/BF01210594zbMath0790.68034OpenAlexW2051929917MaRDI QIDQ1323351

Hanan Samet, Walid G. Aref

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

spatial databasequadtree decompositionquery answering algorithmwindow-based queries

Mathematics Subject Classification ID

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

Related Items (1)

Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

Cites Work

• Unnamed Item
• Ignoring ignorance and agreeing to disagree
• The space efficiency of quadtrees

This page was built for publication: Decomposing a window into maximal quadtree blocks