Efficient regular data structures and algorithms for dilation, location, and proximity problems

DOI10.1007/s00453-001-0013-yzbMath0985.68014OpenAlexW3161744461MaRDI QIDQ5945907

No author found.

Publication date: 19 February 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0013-y

zbMATH Keywords

quadtreestratified tree

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Fast local searches and updates in bounded universes ⋮ Optimal bounds for the predecessor problem and related problems

This page was built for publication: Efficient regular data structures and algorithms for dilation, location, and proximity problems