预处理模糊度不精确点
Preprocessing Ambiguous Imprecise Points
摘要:
令${R} = \{R_1, R_2, ..., R_n\}$是一组区域,令$ X = \{x_1, x_2, ..., x_n\}$是具有$x_i \in R_i$的(未知)点集。区域$R_i$表示$x_i$的不确定性区域。我们考虑以下问题:如果我们被允许在$R$中对区域进行预处理,我们可以多快建立秩序?不确定性的预处理模型使用两个连续的阶段:一个预处理阶段,它只能访问${R}$,随后是一个重建阶段,在此期间,$X$上所需的结构进行计算。该模型的最新结果通过${R}$的层数来参数化重建时间,这是${R}$中区域之间的最大重叠。我们引入模糊性$A({R})$作为${R}$中重叠程度的更细粒度的度量。我们展示了如何在$O(n \log n)$时间内预处理一组$d$维磁盘,以便我们可以在$O(A({R}))$时间内对$X$(如果$d=1$)进行排序并在$X$(如果$d\geq 1$但恒定)上重建四叉树。如果$A({R})$是次线性的,则报告结果支配重建阶段的运行时间。但是,我们仍然可以在$O(A({R}))$时间内返回表示结果的适当数据结构。在一维中,${R}$是一组区间,模糊性与区间熵有关,而区间熵又与部分信息下的排序问题有关。找到偏序集$P$的线性序所需的比较次数是$P$的图熵的下界。我们表明,如果$P$是一个区间顺序,那么模糊性提供了一个常数因子近似的图熵。这给出了重建阶段(排序或任何邻近结构)所有维度上的$Ω(A({R}))$的下限,与任何预处理无关;因此我们的结果是紧的。
英文摘要:
Let ${R} = \{R_1, R_2, ..., R_n\}$ be a set of regions and let $ X = \{x_1, x_2, ..., x_n\}$ be an (unknown) point set with $x_i \in R_i$. Region $R_i$ represents the uncertainty region of $x_i$. We consider the following question: how fast can we establish order if we are allowed to preprocess the regions in $R$? The preprocessing model of uncertainty uses two consecutive phases: a preprocessing phase which has access only to ${R}$ followed by a reconstruction phase during which a desired structure on $X$ is computed. Recent results in this model parametrize the reconstruction time by the ply of ${R}$, which is the maximum overlap between the regions in ${R}$. We introduce the ambiguity $A({R})$ as a more fine-grained measure of the degree of overlap in ${R}$. We show how to preprocess a set of $d$-dimensional disks in $O(n \log n)$ time such that we can sort $X$ (if $d=1$) and reconstruct a quadtree on $X$ (if $d\geq 1$ but constant) in $O(A({R}))$ time. If $A({R})$ is sub-linear, then reporting the result dominates the running time of the reconstruction phase. However, we can still return a suitable data structure representing the result in $O(A({R}))$ time. In one dimension, ${R}$ is a set of intervals and the ambiguity is linked to interval entropy, which in turn relates to the well-studied problem of sorting under partial information. The number of comparisons necessary to find the linear order underlying a poset $P$ is lower-bounded by the graph entropy of $P$. We show that if $P$ is an interval order, then the ambiguity provides a constant-factor approximation of the graph entropy. This gives a lower bound of $Ω(A({R}))$ in all dimensions for the reconstruction phase (sorting or any proximity structure), independent of any preprocessing; hence our result is tight.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。