Browsing by Subject "geometric data structures"
Now showing items 1-2 of 2
-
Data Structures for Colored Counting in Grids and Trees
(2023-08-31)In this thesis, we design data structures for colored counting queries. First, we consider the colored 2D orthogonal range counting problem and present four different time-space tradeoffs. Second, we consider the batched ... -
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing
(2020-08-28)Under the word RAM model, we design three data structures that can be constructed in $O(n\sqrt{\lg n})$ time over $n$ points in an $n \times n$ grid. The first data structure is an $O(n\lg^{\epsilon} n)$-word structure ...