Improved data structures for the orthogonal range successor problem

DOI10.1016/J.COMGEO.2010.09.001MaRDI QIDQ617543zbMATH OpenOpenAlexFDO

Authors Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang

Publication date 21 January 2011

Published in Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsdata structuresindexesorthogonal range searching

Mathematics Subject Classification ID

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

Recommendations

• Efficient Data Structures for the Orthogonal Range Successor Problem
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Two-dimensional range successor in optimal time and almost linear space
• Orthogonal range searching in linear and almost-linear space
• Succinct indices for range queries with applications to orthogonal range maxima

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• scientific article; zbMATH DE number 6146456 (Why is no real title available?)
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Compressed representations of sequences and full-text indexes
• Efficient worst-case data structures for range searching
• Finding Patterns in Given Intervals
• Orthogonal range searching in linear and almost-linear space
• Range Non-overlapping Indexing and Successive List Indexing
• Rank and select revisited and extended
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Using persistent data structures for adding range restrictions to searching problems

Cited in

(15)

• Substring Range Reporting
• Space-efficient fully dynamic DFS in undirected graphs
• Orthogonal range searching for text indexing
• scientific article; zbMATH DE number 6146456 (Why is no real title available?)
• Reporting and counting maximal points in a query orthogonal rectangle
• Two-dimensional range successor in optimal time and almost linear space
• Substring range reporting
• scientific article; zbMATH DE number 7651193 (Why is no real title available?)
• Succinct and Implicit Data Structures for Computational Geometry
• Closed factorization
• Sorted range reporting
• Space efficient data structures for dynamic orthogonal range counting
• Efficient Data Structures for the Orthogonal Range Successor Problem
• Minimal indices for successor search (extended abstract)
• Succinct indices for range queries with applications to orthogonal range maxima

This page was built for publication: Improved data structures for the orthogonal range successor problem

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