Succinct dynamic one-dimensional point reporting

DOI10.4230/LIPICS.SWAT.2018.17zbMATH Open1477.68078MaRDI QIDQ5116481FDOQ5116481

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

Publication date: 25 August 2020

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

zbMATH Keywords

computational geometryrange searchingsuccinct data structures

Mathematics Subject Classification ID

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

Cites Work

• Fully functional static and dynamic succinct trees
• Succinct ordinal trees with level-ancestor queries
• Optimal static range reporting in one dimension
• Two results on tables
• Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
• Title not available (Why is that?)
• A Framework for Dynamizing Succinct Data Structures
• Compressed Data Structures for Dynamic Sequences
• On dynamic range reporting in one dimension
• Title not available (Why is that?)
• Succinct and Implicit Data Structures for Computational Geometry
• Approximate Range Emptiness in Constant Time and Optimal Space
• Succinct Color Searching in One Dimension
• Dynamic Compressed Strings with Random Access

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)