在多边形域内实现平面连杆
Realizing Planar Linkages in Polygonal Domains
AI总结:
研究在开放多边形域内实现结构更简单、刚性更低的连杆的计算复杂性,证明其XP-membership和W[1]-难性,并在特定条件下获得NP难性和线性算法。
摘要:
一个连杆$\mathcal{L}$由图$G=(V,E)$和边长函数$\ell$组成。决定$\mathcal{L}$能否作为$\mathbb{R}^2$中的平面直线嵌入实现,边长为$\ell(e)$对所有$e \in E$,是$\exists\mathbb{R}$-完全的[Abel et al., JoCG'25],即使$\ell \equiv 1$,但连杆的大部分结构是刚性的。本文研究在开放多边形域$P$内,结构更简单、刚性更低的连杆的实现问题,其中某些顶点的位置可能在输入中指定。我们证明了其关于$G$大小的XP-membership和W[1]-难性,即使$\ell \equiv 1$且没有指定顶点位置。此外,我们考虑$G$为路径,具有指定的起始和结束位置,且$\ell \equiv 1$的情况。尽管没有刚性组件,我们一般情况下获得NP难性,并在$G$只有三条边且$P$为凸多边形时,提供任意$\ell$的线性算法。
英文摘要:
A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is $\exists\mathbb{R}$-complete [Abel et al., JoCG'25], even if $\ell \equiv 1$, but a considerable part of $\mathcal{L}$ is rigid. In this paper, we study the computational complexity of the realization question for structurally simpler, less rigid linkages inside an open polygonal domain $P$, where the placement of some vertices may be specified in the input. We show that the problem is in XP parameterized by the size of $G$, and W[1]-hard even if $\ell \equiv 1$ and no vertex positions are constrained. Furthermore, we consider the case where $G$ is a path with constrained start and end position and $\ell\equiv 1$. Despite the absence of any rigid components, we obtain NP-hardness in general, and provide a $\mathcal{O}(n \log n)$ time algorithm for $n$ being the number of vertices of $P$ for arbitrary $\ell$ if $G$ has only three edges, both endpoints are constrained, and $P$ is convex.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。