Persistent predecessor search and orthogonal point location on the word RAM

DOI10.1145/2483699.2483702zbMATH Open1301.68236OpenAlexW2129029222MaRDI QIDQ2933652FDOQ2933652

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

Recommendations

• Persistent predecessor search and orthogonal point location on the word RAM
• scientific article
• Dynamic planar orthogonal point location in sublogarithmic time
• Towards an optimal method for dynamic planar point location
• Time-space trade-offs for predecessor search

zbMATH Keywords

computational geometrypoint locationpersistent data structuresword-RAM algorithms

Mathematics Subject Classification ID

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

Cited In (10)

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

This page was built for publication: Persistent predecessor search and orthogonal point location on the word RAM

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