Dynamic orthogonal range searching on the RAM, revisited

DOI10.4230/LIPICS.SOCG.2017.28MaRDI QIDQ4580102zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Konstantinos Tsakalidis

Publication date 13 August 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.SoCG.2017.28

zbMATH Keywords

computational geometryrange searchingdynamic data structures

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Amortized bounds for dynamic orthogonal range reporting
• Fully Dynamic Orthogonal Range Reporting on RAM
• Space efficient dynamic orthogonal range reporting
• Space efficient dynamic orthogonal range reporting
• Dynamic planar orthogonal point location in sublogarithmic time

Cited in

(14)

• Space efficient dynamic orthogonal range reporting
• Orthogonal range searching on the RAM, revisited
• Repetition Detection in a Dynamic String
• Amortized bounds for dynamic orthogonal range reporting
• Concurrent range reporting in two-dimensional space
• Fully Dynamic Orthogonal Range Reporting on RAM
• Dynamic 3-sided planar range queries with expected doubly-logarithmic time
• Towards tight lower bounds for range reporting on the RAM
• Space efficient dynamic orthogonal range reporting
• Near-optimal quantum algorithms for string problems
• Efficient dynamic range searching using data replication
• Improved time and space bounds for dynamic range mode
• Dynamic planar orthogonal point location in sublogarithmic time
• scientific article; zbMATH DE number 7651158 (Why is no real title available?)

This page was built for publication: Dynamic orthogonal range searching on the RAM, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580102)