线性空间中的动态范围选择
Dynamic Range Selection in Linear Space
摘要:
给定平面上$n$点的集合$S$,我们考虑在$S$上回答范围选择查询的问题:即,给定任意$x$ -范围$Q$和整数$k > 0$,从在$Q$中具有$x$ -坐标的点集合中返回第$k$ -最小的$y$ -坐标.我们提出了一个线性空间数据结构,保持一个动态的$n$点在平面上的真实坐标,并支持范围选择查询$O((\lg n / \lg \lg n)^2)$时间,以及插入和删除在$O((\lg n / \lg \lg n)^2)$摊销时间。该数据结构的空间使用是对先前最佳结果的$Θ(\lg n / \lg \lg n)$因子改进,同时保持渐进匹配的查询和更新时间。我们还提出了一个简洁的数据结构,支持范围选择查询的动态数组的$n$值从一个有界的宇宙。
英文摘要:
Given a set $S$ of $n$ points in the plane, we consider the problem of answering range selection queries on $S$: that is, given an arbitrary $x$-range $Q$ and an integer $k > 0$, return the $k$-th smallest $y$-coordinate from the set of points that have $x$-coordinates in $Q$. We present a linear space data structure that maintains a dynamic set of $n$ points in the plane with real coordinates, and supports range selection queries in $O((\lg n / \lg \lg n)^2)$ time, as well as insertions and deletions in $O((\lg n / \lg \lg n)^2)$ amortized time. The space usage of this data structure is an $Θ(\lg n / \lg \lg n)$ factor improvement over the previous best result, while maintaining asymptotically matching query and update times. We also present a succinct data structure that supports range selection queries on a dynamic array of $n$ values drawn from a bounded universe.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。