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

曲线自由空间的可实现性

Realizability of Free Spaces of Curves

Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk

AI总结:

本文研究自由空间图的可实现性,即给定图是否存在生成它的曲线,通过关联距离几何问题,证明了在R≥2中该问题为∃R-完全,在R¹中连续情况为弱NP难且可伪多项式求解,离散情况可多项式求解。

摘要:

自由空间图是计算著名的弗雷歇距离的常用工具。由于弗雷歇距离在许多不同领域中使用,已经建立了许多变体来满足这些应用的具体需求。通常会出现这样一个问题:自由空间图中的某种模式是否“可实现”,即是否存在一对多边形链,其自由空间图与之对应。这个问题的答案可能有助于决定这些距离度量的计算复杂性,并允许为受限输入类别设计更高效的算法,以避免某些自由空间模式。因此,我们研究逆问题:给定一个潜在的自由空间图,是否存在生成该图的曲线?\n我们关注的问题与经典的“距离几何”问题密切相关。我们解决了$\nmathbb{R}^{> 2}$中距离几何的复杂性,证明了其$\n存在\mathbb{R}$-难度。我们利用这一点来表明,对于$\mathbb{R}^{\ge 2}$中的曲线,可实现性问题在连续和离散弗雷歇距离下都是$\exists\mathbb{R}$-完全的。我们证明了$\mathbb{R}^1$中的连续情况仅是弱NP难的,我们提供了一个伪多项式时间算法,并表明它是固定参数可处理的。有趣的是,对于$\mathbb{R}^1$中的离散情况,我们表明该问题可以在多项式时间内解决。

英文摘要:

The free space diagram is a popular tool to compute the well-known Fréchet distance. As the Fréchet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often, the question arises whether a certain pattern in the free space diagram is "realizable", i.e., whether there exists a pair of polygonal chains whose free space diagram corresponds to it. The answer to this question may help in deciding the computational complexity of these distance measures, as well as allowing to design more efficient algorithms for restricted input classes that avoid certain free space patterns. Therefore, we study the inverse problem: Given a potential free space diagram, do there exist curves that generate this diagram? Our problem of interest is closely tied to the classic Distance Geometry problem. We settle the complexity of Distance Geometry in $\mathbb{R}^{> 2}$, showing $\exists\mathbb{R}$-hardness. We use this to show that for curves in $\mathbb{R}^{\ge 2}$, the realizability problem is $\exists\mathbb{R}$-complete, both for continuous and for discrete Fréchet distance. We prove that the continuous case in $\mathbb{R}^1$ is only weakly NP-hard, and we provide a pseudo-polynomial time algorithm and show that it is fixed-parameter tractable. Interestingly, for the discrete case in $\mathbb{R}^1$, we show that the problem becomes solvable in polynomial time.

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

↑