arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.00271cs.CGcs.DS
收藏

构建完全动态凸包

Engineering Fully Dynamic Convex Hulls

IT University of Copenhagen(哥本哈根信息技术大学);Heidelberg University(海德堡大学)

Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg

AI总结:

本文提出了一种新的完全动态算法,用于在插入和删除操作下维护凸包并支持几何查询。通过结合对数方法与仅支持删除的凸包数据结构,实现了O(log n log log n)的均摊更新时间和O(log²n)的查询时间。

摘要:

我们提出了一种新的完全动态算法,用于在插入和删除操作下维护凸包并支持几何查询。我们的方法结合了对数方法与仅支持删除的凸包数据结构,实现了均摊更新时间为O(log n log log n)和查询时间为O(log²n)。我们提供了一个稳健且非平凡的实现,支持点定位查询,这是一种具有挑战性和非分解性的凸包查询类别。我们评估了我们的实现与现有技术的对比,包括一个新的简单基线,该基线在更新影响凸包时重建凸包。在包含多项式数量数据点(例如Θ(n^ε)对于某些ε)的凸包上,如实践中常见的那些,我们的方法优于所有其他技术。更新密集型工作负载强烈偏爱我们的方法,这与我们的理论保证一致。然而,我们的方法在更新到查询比例为1:10时仍然具有竞争力。此外,对现实世界数据集的实验还揭示了现有完全动态技术存在显著的鲁棒性问题。相比之下,我们的实现在所有测试输入上都保持稳定。

英文摘要:

We present a new fully dynamic algorithm for maintaining convex hulls under insertions and deletions while supporting geometric queries. Our approach combines the logarithmic method with a deletion-only convex hull data structure, achieving amortised update times of $O(\log n \log \log n)$ and query times of $O(\log^2 n)$. We provide a robust and non-trivial implementation that supports point-location queries, a challenging and non-decomposable class of convex hull queries. We evaluate our implementation against the state of the art, including a new naive baseline that rebuilds the convex hull whenever an update affects it. On hulls that include polynomially many data points (e.g. $Θ(n^\varepsilon)$ for some $\varepsilon$), such as the ones that often occur in practice, our method outperforms all other techniques. Update-heavy workloads strongly favour our approach, which is in line with our theoretical guarantees. Yet, our method remains competitive all the way down to when the update to query ratio is $1$ to $10$. Experiments on real-world data sets furthermore reveal that existing fully dynamic techniques suffer from significant robustness issues. In contrast, our implementation remains stable across all tested inputs.

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

↑