优先级范围树
Priority Range Trees
摘要:
我们描述了一个数据结构,称为优先级范围树,它可以容纳快速正交范围报告查询优先点。令$S$是平面中的一组$n$点,其中$S$中的每个点$p$被分配一个在$n$中为多项式的权重$w(p)$,并且将$p$的秩定义为$r(p)=\lfloor \log w(p) \rfloor$。然后,优先级范围树可以用于报告三边或四边查询范围$R$中的所有点,其中在时间$O(\log W/w + k)$中排名至少为$\lfloor \log w \rfloor$,并且在时间$O(\log\log n + \log W/w' + k)$中报告$k$中排名最高的点,其中$W=\sum_{p\in S}{w(p)}$,$w'$是所报告的任何点的最小权重,并且$k$是输出大小。所有时间都假设标准的RAM计算模型。如果感兴趣的查询范围是三边的,则优先级范围树占用$O(n)$空间,否则使用$O(n\log n)$空间来回答四边查询。这些查询的动机是Weber-Fechner定律,该定律指出人类在对数尺度上感知和解释数据。
英文摘要:
We describe a data structure, called a priority range tree, which accommodates fast orthogonal range reporting queries on prioritized points. Let $S$ be a set of $n$ points in the plane, where each point $p$ in $S$ is assigned a weight $w(p)$ that is polynomial in $n$, and define the rank of $p$ to be $r(p)=\lfloor \log w(p) \rfloor$. Then the priority range tree can be used to report all points in a three- or four-sided query range $R$ with rank at least $\lfloor \log w \rfloor$ in time $O(\log W/w + k)$, and report $k$ highest-rank points in $R$ in time $O(\log\log n + \log W/w' + k)$, where $W=\sum_{p\in S}{w(p)}$, $w'$ is the smallest weight of any point reported, and $k$ is the output size. All times assume the standard RAM model of computation. If the query range of interest is three sided, then the priority range tree occupies $O(n)$ space, otherwise $O(n\log n)$ space is used to answer four-sided queries. These queries are motivated by the Weber--Fechner Law, which states that humans perceive and interpret data on a logarithmic scale.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。