arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.11433cs.CG
收藏

平面对象相交报告的下限

Lower Bounds for Intersection Reporting among Flat Objects

Peyman Afshani, Pingan Cheng

摘要:

最近,Ezra和Sharir [ES 22 a]显示了$O(n^{3/2+σ})$空间和$O(n^{1/2+σ})$查询时间数据结构,用于$\mathbb{R}^3$中三角形之间的射线拍摄。这在近25年来首次提高了经典$S(n)Q(n)^4=O(n^{4+σ})$时空权衡给出的上限,实际上位于$S(n)Q(n)^3=O(n^{3+σ})$的权衡曲线上。然而,似乎很难将他们的技术应用到这个特定的空间和时间组合之外。这种现象在几乎所有最近的平面对象相交搜索的进展中持续出现,例如,$\mathbb{R}^4$ [ES 22 b]中的线-四面体相交,$\mathbb{R}^4$ [ES 22 b]中的三角形-三角形相交,甚至是平面半代数对象之间的相交[AAEKS 22]。我们从下界的角度对这一现象给出了及时的解释。我们证明,给定一组$\mathcal{S}$维单纯形在$\mathbb{R}^d$,任何数据结构,可以报告所有的交集与小($n^{o(1)}$)查询时间必须使用$Ω(n^{2(d-1)-o(1)})$空间。这使得对小查询时间的权衡曲线进行任何重大改进的希望破灭,并且几乎与经典的上限相匹配。当查询时间较小时,我们还得到了$\mathbb{R}^4$中三角形-三角形相交报告的$Ω(n^{6-o(1)})$的几乎匹配空间下界。在此过程中,我们进一步发展了Afshani和Cheng [AC 21,AC 22]以前的下界技术。

英文摘要:

Recently, Ezra and Sharir [ES22a] showed an $O(n^{3/2+σ})$ space and $O(n^{1/2+σ})$ query time data structure for ray shooting among triangles in $\mathbb{R}^3$. This improves the upper bound given by the classical $S(n)Q(n)^4=O(n^{4+σ})$ space-time tradeoff for the first time in almost 25 years and in fact lies on the tradeoff curve of $S(n)Q(n)^3=O(n^{3+σ})$. However, it seems difficult to apply their techniques beyond this specific space and time combination. This pheonomenon appears persistently in almost all recent advances of flat object intersection searching, e.g., line-tetrahedron intersection in $\mathbb{R}^4$ [ES22b], triangle-triangle intersection in $\mathbb{R}^4$ [ES22b], or even among flat semialgebraic objects [AAEKS22]. We give a timely explanation to this phenomenon from a lower bound perspective. We prove that given a set $\mathcal{S}$ of $(d-1)$-dimensional simplicies in $\mathbb{R}^d$, any data structure that can report all intersections with small ($n^{o(1)}$) query time must use $Ω(n^{2(d-1)-o(1)})$ space. This dashes the hope of any significant improvement to the tradeoff curves for small query time and almost matches the classical upper bound. We also obtain an almost matching space lower bound of $Ω(n^{6-o(1)})$ for triangle-triangle intersection reporting in $\mathbb{R}^4$ when the query time is small. Along the way, we further develop the previous lower bound techniques by Afshani and Cheng [AC21, AC22].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑