Amortized bounds for dynamic orthogonal range reporting

DOI10.1007/978-3-662-44777-2_69MaRDI QIDQ2921468zbMATH OpenOpenAlexFDO

Authors Bryan T. Wilkinson

Publication date 8 October 2014

Published in Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44777-2_69

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dynamic orthogonal range searching on the RAM, revisited
• 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

(7)

• The nearest colored node in a tree
• Dynamic 3-sided planar range queries with expected doubly-logarithmic time
• Data Structures with Local Update Operations
• Dynamic orthogonal range searching on the RAM, revisited
• Dynamic planar orthogonal point location in sublogarithmic time
• The cell probe complexity of dynamic range counting
• Fully Dynamic Orthogonal Range Reporting on RAM

This page was built for publication: Amortized bounds for dynamic orthogonal range reporting

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