Succinct dynamic one-dimensional point reporting

DOI10.4230/LIPICS.SWAT.2018.17MaRDI QIDQ5116481zbMATH OpenFDO

Authors Hicham El-Zein, J. Ian Munro, Yakov Nekrich

Publication date 25 August 2020

zbMATH Keywords

computational geometryrange searchingsuccinct data structures

Mathematics Subject Classification ID

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

Recommendations

• Succinct color searching in one dimension
• Space efficient dynamic orthogonal range reporting
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting
• Space efficient dynamic orthogonal range reporting
• scientific article; zbMATH DE number 1830754

Cites work

• scientific article; zbMATH DE number 1263186 (Why is no real title available?)
• A Framework for Dynamizing Succinct Data Structures
• Approximate range emptiness in constant time and optimal space
• Compressed Data Structures for Dynamic Sequences
• Dynamic Compressed Strings with Random Access
• Fully functional static and dynamic succinct trees
• On dynamic range reporting in one dimension
• Optimal static range reporting in one dimension
• Succinct and Implicit Data Structures for Computational Geometry
• Succinct color searching in one dimension
• Succinct geometric indexes supporting point location queries
• Succinct indices for range queries with applications to orthogonal range maxima
• Succinct ordinal trees with level-ancestor queries
• Two results on tables

Cited in

(2)

• Succinct color searching in one dimension
• Optimal static range reporting in one dimension

This page was built for publication: Succinct dynamic one-dimensional point reporting

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