arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.07039cs.CG
收藏

近似低密度值

Approximating the lambda-low-density value

Joachim Gudmundsson, Zijin Huang, Sampson Wong

摘要:

现实输入模型的使用已经在理论界得到普及。假设一个现实的输入模型往往排除了复杂的假设输入,分析产生的界限,更好地反映了算法在实践中的行为。多边形曲线和线段最流行的模型之一是$λ$ -低密度。为了为某个输入选择最有效的算法,通常需要计算$λ$ -低密度值,或者至少是一个近似值。在本文中,我们表明,给定一组$n$线段在$\mathbb{R}^2$可以计算$3$ -近似的$λ$ -低密度值在$O(n \log n + λn)$时间。我们还展示了如何保持$3$ -近似的$λ$ -低密度值,同时允许插入新的片段在$O(\log n + λ^2)$摊销时间每次更新。最后,我们认为,许多现实世界的数据集有一个小的$λ$ -低密度值,最近发展的专门算法。这是通过计算$12$真实世界数据集的近似$λ$ -低密度值来完成的。

英文摘要:

The use of realistic input models has gained popularity in the theory community. Assuming a realistic input model often precludes complicated hypothetical inputs, and the analysis yields bounds that better reflect the behaviour of algorithms in practice. One of the most popular models for polygonal curves and line segments is $λ$-low-density. To select the most efficient algorithm for a certain input, one often needs to compute the $λ$-low-density value, or at least an approximate value. In this paper, we show that given a set of $n$ line segments in $\mathbb{R}^2$ one can compute a $3$-approximation of the $λ$-low density value in $O(n \log n + λn)$ time. We also show how to maintain a $3$-approximation of the $λ$-low density value while allowing insertions of new segments in $O(\log n + λ^2)$ amortized time per update. Finally, we argue that many real-world data sets have a small $λ$-low density value, warranting the recent development of specialised algorithms. This is done by computing approximate $λ$-low density values for $12$ real-world data sets.

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

↑