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

一种求解翻转距离问题的改进FPT算法

An Improved FPT Algorithm for the Flip Distance Problem

Qilong Feng, Shaohua Li, Xiangzhong Meng, Jianxin Wang

摘要:

给定欧几里得平面上的一组点$\cal P$和$\cal P$的两个三角剖分,这两个三角剖分之间的翻转距离是将一个三角剖分变换为另一个三角剖分所需的最小翻转次数。参数化翻转距离问题是决定两个给定三角剖分之间的翻转距离是否等于给定的整数$k$。先前的最佳FPT算法在时间$O^{*}(k\cdot c^{k})$($c\leq 2\times 14^{11}$)中运行,其中每个步骤有14个可能的选择,并且动作序列的长度由$11k$限定。通过应用回溯策略和分析翻转序列的潜在性质,我们的算法的每一步只有五个可能的选择。基于一个辅助图$G$,我们证明了我们算法的动作序列的长度是有界的$2|G|$。因此,我们提出了一个FPT算法运行在时间$O^{*}(k\cdot 32^{k})$。

英文摘要:

Given a set $\cal P$ of points in the Euclidean plane and two triangulations of $\cal P$, the flip distance between these two triangulations is the minimum number of flips required to transform one triangulation into the other. Parameterized Flip Distance problem is to decide if the flip distance between two given triangulations is equal to a given integer $k$. The previous best FPT algorithm runs in time $O^{*}(k\cdot c^{k})$ ($c\leq 2\times 14^{11}$), where each step has fourteen possible choices, and the length of the action sequence is bounded by $11k$. By applying the backtracking strategy and analyzing the underlying property of the flip sequence, each step of our algorithm has only five possible choices. Based on an auxiliary graph $G$, we prove that the length of the action sequence for our algorithm is bounded by $2|G|$. As a result, we present an FPT algorithm running in time $O^{*}(k\cdot 32^{k})$.

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

↑