Space efficient data structures for dynamic orthogonal range counting

DOI10.1016/J.COMGEO.2013.08.007zbMATH Open1312.65022OpenAlexW2083101719MaRDI QIDQ390134FDOQ390134

Authors: Meng He, J. Ian Munro 

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.08.007

Recommendations

• Space Efficient Data Structures for Dynamic Orthogonal Range Counting
• Orthogonal range searching in linear and almost-linear space
• Orthogonal Range Searching in Linear and Almost-Linear Space
• Space efficient dynamic orthogonal range reporting
• Space efficient dynamic orthogonal range reporting

zbMATH Keywords

succinct data structuredynamic data structuregeometric data structureorthogonal range counting

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Compressed representations of sequences and full-text indexes
• Compressing and indexing labeled trees, with applications
• Title not available (Why is that?)
• Succinct indexes for strings, binary relations and multilabeled trees
• Adding range restriction capability to dynamic data structures
• Decomposable searching problems
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Title not available (Why is that?)
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Dynamic entropy-compressed sequences and full-text indexes
• Rank/select on dynamic compressed sequences and applications
• Dynamic range selection in linear space
• Optimal External Memory Interval Management
• Improved data structures for the orthogonal range successor problem
• New Data Structures for Orthogonal Range Queries
• Succinct representation of labeled graphs
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• Rank and select revisited and extended
• Title not available (Why is that?)
• Orthogonal range searching in linear and almost-linear space
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting
• The cell probe complexity of dynamic range counting

Cited In (8)

• Dynamic layers of maxima with applications to dominating queries
• Resolving SINR queries in a dynamic setting
• Internal dictionary matching
• Dynamic path queries in linear space
• Resolving SINR Queries in a Dynamic Setting
• Title not available (Why is that?)
• Cache-oblivious data structures for orthogonal range searching
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting

This page was built for publication: Space efficient data structures for dynamic orthogonal range counting

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