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

连续Fréchet距离下子轨迹聚类的三次上下界

Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance

Joachim Gudmundsson, Sampson Wong

摘要:

在运动数据中检测通勤模式或迁移模式是计算运动分析中的一个重要问题。给定一个轨迹或一组轨迹,这对应于聚类相似的子轨迹。我们研究连续和离散Fréchet距离下的子轨迹聚类。最相关的理论结果来自Buchin等人(2011)。在连续情况下,它们提供了一个$O(n^5)$时间算法和一个3SUM硬度下限,在离散情况下,一个$O(n^3)$时间算法。我们表明,在连续的情况下,一个$O(n^3 \log^2 n)$时间算法和3 OV-硬度下限,并在离散的情况下,一个$O(n^2 \log n)$时间算法和二次下界。我们的边界几乎是紧密的,除非赛斯失败。

英文摘要:

Detecting commuting patterns or migration patterns in movement data is an important problem in computational movement analysis. Given a trajectory, or set of trajectories, this corresponds to clustering similar subtrajectories. We study subtrajectory clustering under the continuous and discrete Fréchet distances. The most relevant theoretical result is by Buchin et al. (2011). They provide, in the continuous case, an $O(n^5)$ time algorithm and a 3SUM-hardness lower bound, and in the discrete case, an $O(n^3)$ time algorithm. We show, in the continuous case, an $O(n^3 \log^2 n)$ time algorithm and a 3OV-hardness lower bound, and in the discrete case, an $O(n^2 \log n)$ time algorithm and a quadratic lower bound. Our bounds are almost tight unless SETH fails.

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

↑