基于对偶的深度查询和最大深度近似算法
Duality-based approximation algorithms for depth queries and maximum depth
摘要:
我们设计了一个有效的数据结构,用于计算一个适当定义的近似深度的任何查询点的安排$\mathcal{A}(S)$的集合$S$的$n$半平面或三角形的平面或半空间或单形在更高的维度。然后,我们使用该结构来找到$\mathcal{A}(S)$中近似最大深度的点。具体来说,给定一个错误参数$ε>0$,我们计算,对于任何查询点$q$,低估$d^-(q)$的深度$q$,只计数对象包含$q$,但允许排除对象时,$q$是$ε$ -接近它们的边界。类似地,我们计算高估的$d^+(q)$,其对包含$q$的所有对象进行计数,但也可以对不包含$q$但$q$是$ε$ -接近其边界的对象进行计数。我们的半平面和半空间的算法是线性的输入对象的数量和查询的数量,其运行时间的依赖$ε$是相当好的比以前的技术。我们的改进对于三角形和更高维度来说尤其重要。
英文摘要:
We design an efficient data structure for computing a suitably defined approximate depth of any query point in the arrangement $\mathcal{A}(S)$ of a collection $S$ of $n$ halfplanes or triangles in the plane or of halfspaces or simplices in higher dimensions. We then use this structure to find a point of an approximate maximum depth in $\mathcal{A}(S)$. Specifically, given an error parameter $ε>0$, we compute, for any query point $q$, an underestimate $d^-(q)$ of the depth of $q$, that counts only objects containing $q$, but is allowed to exclude objects when $q$ is $ε$-close to their boundary. Similarly, we compute an overestimate $d^+(q)$ that counts all objects containing $q$ but may also count objects that do not contain $q$ but $q$ is $ε$-close to their boundary. Our algorithms for halfplanes and halfspaces are linear in the number of input objects and in the number of queries, and the dependence of their running time on $ε$ is considerably better than that of earlier techniques. Our improvements are particularly substantial for triangles and in higher dimensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。