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

不相交线段的外切多边形和多边形化

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

Hugo A. Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth

摘要:

给定$\mathbb{R}^2$中的平面直线图$G=(V,E)$,$G$的一个\emph{circumscribing polygon}是一个顶点集为$V$的简单多边形$P$,$E$中的每条边是$P$的一条边或内对角线.如果$E$中的每条边都是$P$的边,则外接多边形是$G$的\emph{polygonization}。我们证明了平面上$n$不相交线段的每一个排列都有一个大小为$Ω(\sqrt{n})$的子集,它允许一个外接多边形,这是20年来对这个界的第一次改进。我们探讨了组合几何中的外切多边形和其他问题之间的关系,以及对$\mathbb{R}^3$的推广。证明了判定给定图$G$是否有外切多边形是NP完全的,即使$G$是2-正则的.解决了Rappaport的一个30年前的猜想,我们还证明了确定一个几何匹配是否允许非线性化是NP完全的。

英文摘要:

Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing polygon is a \emph{polygonization} for $G$ if every edge in $E$ is an edge of $P$. We prove that every arrangement of $n$ disjoint line segments in the plane has a subset of size $Ω(\sqrt{n})$ that admits a circumscribing polygon, which is the first improvement on this bound in 20 years. We explore relations between circumscribing polygons and other problems in combinatorial geometry, and generalizations to $\mathbb{R}^3$. We show that it is NP-complete to decide whether a given graph $G$ admits a circumscribing polygon, even if $G$ is 2-regular. Settling a 30-year old conjecture by Rappaport, we also show that it is NP-complete to determine whether a geometric matching admits a polygonization.

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

↑