Improved data structures for the orthogonal range successor problem

DOI10.1016/j.comgeo.2010.09.001zbMath1209.65027OpenAlexW1991365862MaRDI QIDQ617543

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

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)

Related Items (10)

Closed factorization ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Two-dimensional range successor in optimal time and almost linear space ⋮ Unnamed Item ⋮ Substring Range Reporting ⋮ Substring range reporting ⋮ Reporting and counting maximal points in a query orthogonal rectangle ⋮ Space-efficient fully dynamic DFS in undirected graphs ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Orthogonal Range Searching for Text Indexing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal range searching in linear and almost-linear space
• Efficient worst-case data structures for range searching
• Rank and select revisited and extended
• Compressed representations of sequences and full-text indexes
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Finding Patterns in Given Intervals
• Range Non-overlapping Indexing and Successive List Indexing
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Using persistent data structures for adding range restrictions to searching problems

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