Efficient data structures for range searching on a grid

DOI10.1016/0196-6774(88)90041-7zbMath0637.68067OpenAlexW1985273367MaRDI QIDQ3777465

Mark H. Overmars

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/16542

zbMATH Keywords

computer graphicsdata structuresdatabase designinteger grid2-dimensional range searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (10)

An algorithm for handling many relational calculus queries efficiently. ⋮ Computing a poset from its realizer ⋮ Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing ⋮ Scanline algorithms on a grid ⋮ The range 1 query (R1Q) problem ⋮ Dynamic planar range skyline queries in log logarithmic expected time ⋮ Dynamic 3-sided planar range queries with expected doubly-logarithmic time ⋮ Using persistent data structures for adding range restrictions to searching problems ⋮ Fast local searches and updates in bounded universes ⋮ Compressing dictionary matching index via sparsification technique

This page was built for publication: Efficient data structures for range searching on a grid