Dynamic orthogonal range searching on the RAM, revisited

DOI10.4230/LIPICS.SOCG.2017.28zbMATH Open1432.68505OpenAlexW3133750907MaRDI QIDQ4580102FDOQ4580102

Konstantinos Tsakalidis, Timothy M. Chan

Publication date: 13 August 2018

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

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

zbMATH Keywords

computational geometryrange searchingdynamic data structures

Mathematics Subject Classification ID

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

Cited In (8)

• Space efficient dynamic orthogonal range reporting
• Fully Dynamic Orthogonal Range Reporting on RAM
• Orthogonal range searching on the RAM, revisited
• Improved Time and Space Bounds for Dynamic Range Mode
• Title not available (Why is that?)
• Near-optimal quantum algorithms for string problems
• Title not available (Why is that?)
• Repetition Detection in a Dynamic String

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)