Persistent Predecessor Search and Orthogonal Point Location on the Word RAM

DOI10.1145/2483699.2483702zbMath1301.68236OpenAlexW2129029222MaRDI QIDQ2933652

Timothy M. Chan

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2483699.2483702

zbMATH Keywords

computational geometrypoint locationpersistent data structuresword-RAM algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (10)

Reporting consecutive substring occurrences under bounded gap constraints ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Unnamed Item ⋮ Optimal window queries on line segments using the trapezoidal search DAG ⋮ Random access in persistent strings and segment selection ⋮ Succinct indexes for reporting discriminating and generic words ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Unnamed Item ⋮ Two approaches to building time-windowed geometric data structures ⋮ On constant factors in comparison-based geometric algorithms and data structures

This page was built for publication: Persistent Predecessor Search and Orthogonal Point Location on the Word RAM