三维平面半代数对象的相交查询及相关问题
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
AI总结:
本文研究三维板与代数弧之间的相交查询问题,结合多项式划分和实代数几何工具,构建空间—查询时间可权衡的数据结构,并推广改进弧查询界。
摘要:
令 $\mathcal{T}$ 为 $\mathbb{R}^3$ 中 $n$ 个具有常数复杂度的平坦(平面)半代数区域(例如三角形、圆盘)组成的集合,我们称之为板(plates)。我们希望将 $\mathcal{T}$ 预处理为一种数据结构,使得对于同样是一块板的查询对象 $γ$,能够快速回答各种相交查询,例如检测 $γ$ 是否与 $\mathcal{T}$ 中任何板相交、报告所有与 $γ$ 相交的板,或对这些板进行计数。我们还考虑这一一般设定的两个更简单情形:(i) 输入对象是板,而查询对象是 $\mathbb{R}^3$ 中常数次数的参数化代数弧(简称弧);或 (ii) 输入对象是弧,而查询对象是 $\mathbb{R}^3$ 中的板。除了本身具有研究意义之外,这两种特殊情形的数据结构还构成处理一般情形的构建模块。通过将多项式划分技术与实代数几何中的其他工具相结合,我们提出了许多用于相交查询的不同数据结构,它们还在存储空间与查询时间之间提供了权衡。例如,如果 $\mathcal{T}$ 是一组板且查询对象为代数弧,我们得到一种使用 $O^*(n^{4/3})$ 存储空间的数据结构(其中 $O^*(\cdot)$ 记号隐藏了形如 $n^ε$ 的因子,$ε>0$ 可任意小),并能在 $O^*(n^{2/3})$ 时间内回答一次弧相交查询。这一结果具有重要意义,因为其指数不依赖于输入对象和查询对象的具体形状。我们对该结果进行了推广并略有改进:对于参数 $s\in [n^{4/3}, n^{t_q}]$,其中 ${t_q}\ge 3$ 是指定一条查询弧所需的实参数数量,通过将存储空间增加到 $O^*(s)$,查询时间可降低至 $O^*((n/s^{1/{t_q}})^{\tfrac{2/3}{1-1/{t_q}}})$。
英文摘要:
Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query object $γ$, which is also a plate, we can quickly answer various intersection queries, such as detecting whether $γ$ intersects any plate of $\mathcal{T}$, reporting all the plates intersected by $γ$, or counting them. We also consider two simpler cases of this general setting: (i) the input objects are plates and the query objects are constant-degree parametrized algebraic arcs in $\mathbb{R}^3$ (arcs, for short), or (ii) the input objects are arcs and the query objects are plates in $\mathbb{R}^3$. Besides being interesting in their own right, the data structures for these two special cases form the building blocks for handling the general case. By combining the polynomial-partitioning technique with additional tools from real algebraic geometry, we present many different data structures for intersection queries, which also provide trade-offs between their size and query time. For example, if $\mathcal{T}$ is a set of plates and the query objects are algebraic arcs, we obtain a data structure that uses $O^*(n^{4/3})$ storage (where the $O^*(\cdot)$ notation hides factors of the form $n^ε$, for an arbitrarily small $ε>0$) and answers an arc-intersection query in $O^*(n^{2/3})$ time. This result is significant since the exponents do not depend on the specific shape of the input and query objects. We generalize and slightly improve this result: for a parameter $s\in [n^{4/3}, n^{t_q}]$, where ${t_q}\ge 3$ is the number of real parameters needed to specify a query arc, the query time can be decreased to $O^*((n/s^{1/{t_q}})^{\tfrac{2/3}{1-1/{t_q}}})$ by increasing the storage to $O^*(s)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。