General methods for adding range restrictions to decomposable searching problems

DOI10.1016/S0747-7171(89)80002-1zbMath0668.68073OpenAlexW1981790190MaRDI QIDQ1118417

Hans W. Scholten, Mark H. Overmars

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80002-1

zbMATH Keywords

range searchingdecomposable searchingdynamic structuresrange restrictions

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (8)

A technique for adding range restrictions to generalized searching problems ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Connected component and simple polygon intersection searching ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Using persistent data structures for adding range restrictions to searching problems ⋮ Connected component and simple polygon intersection searching ⋮ Efficient splitting and merging algorithms for order decomposable problems.

Cites Work

• Efficient worst-case data structures for range searching
• Decomposable searching problems
• Adding range restriction capability to dynamic data structures

This page was built for publication: General methods for adding range restrictions to decomposable searching problems