平面上具有常数查询时间的动态几何连通性
Dynamic Geometric Connectivity in the Plane with Constant Query Time
AI总结:
提出了首个针对2D几何相交图的完全动态连通性数据结构,在轴对齐线段、圆盘和任意线段上实现了常数查询时间和亚线性摊还更新时间,并支持全局连通性查询,大幅改进了此前的查询与更新时间界限。
摘要:
我们提出了首个针对几何相交图的完全动态连通性数据结构,对于2D中的大多数几何对象类型,实现了常数查询时间和亚线性摊还更新时间。我们的数据结构可以回答两个对象之间的连通性查询,以及“全局”连通性查询(例如,判断整个图是否连通)。此前,Afshani和Chan(ESA'06)的数据结构仅在轴对齐线段或矩形的特殊情况下实现了此类界限,但不适用于任意线段或圆盘,而Chan、Pătraşcu和Roditty(FOCS'08)的数据结构虽然适用于更一般的几何对象类别,但需要 $n^{Ω(1)}$ 的查询时间且无法处理全局连通性查询。具体而言,我们获得了具有 $O(1)$ 查询时间且摊还更新时间分别接近 $n^{4/5}$、$n^{7/8}$ 和 $n^{20/21}$ 的新数据结构,分别适用于轴对齐线段、圆盘和任意线段。除了大幅减少查询时间外,我们的数据结构还改进了Afshani和Chan此前针对轴对齐线段的更新时间(从接近 $n^{10/11}$ 降至 $n^{4/5}$),以及Chan、Pătraşcu和Roditty此前针对圆盘的更新时间(从接近 $n^{20/21}$ 降至 $n^{7/8}$)。
英文摘要:
We present the first fully dynamic connectivity data structures for geometric intersection graphs achieving constant query time and sublinear amortized update time for most types of geometric objects in 2D. Our data structures can answer connectivity queries between two objects, as well as "global" connectivity queries (e.g., deciding whether the entire graph is connected). Previously, the data structure by Afshani and Chan (ESA'06) achieved such bounds only in the special case of axis-aligned line segments or rectangles but did not work for arbitrary line segments or disks, whereas the data structures by Chan, Pătraşcu and Roditty (FOCS'08) worked for more general classes of geometric objects but required $n^{Ω(1)}$ query time and could not handle global connectivity queries. Specifically, we obtain new data structures with $O(1)$ query time and amortized update time near $n^{4/5}$, $n^{7/8}$, and $n^{20/21}$ for axis-aligned line segments, disks, and arbitrary line segments respectively. Besides greatly reducing the query time, our data structures also improve the previous update times for axis-aligned line segments by Afshani and Chan (from near $n^{10/11}$ to $n^{4/5}$) and for disks by Chan, Pătraşcu, and Roditty (from near $n^{20/21}$ to $n^{7/8}$).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。