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

双色匹配的线性变换距离

Linear transformation distance for bichromatic matchings

Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber

摘要:

设$P=B\cup R$是一般位置的一组$2n$点,其中$B$是一组$n$蓝点,$R$是一组$n$红点。\emph{$BR$-matching}是$P$上的平面几何完美匹配,使得每条边具有一个红色端点和一个蓝色端点。如果两个$BR$ -匹配的并集也是平面的,则它们是相容的。当且仅当相应的两个$BR$匹配兼容时,\emph{transformation graph of $BR$-matchings}包含用于每个$BR$匹配的一个节点和连接两个这样的节点的边。在SoCG 2013中,Aloupis,Barba,Langerman和Souvaine已经证明了这个变换图总是连通的,但它的直径仍然是一个悬而未决的问题。本文给出了变换图连通性的另一种证明,并证明了$2n$关于其直径的一个上界,该上界是渐近紧的。

英文摘要:

Let $P=B\cup R$ be a set of $2n$ points in general position, where $B$ is a set of $n$ blue points and $R$ a set of $n$ red points. A \emph{$BR$-matching} is a plane geometric perfect matching on $P$ such that each edge has one red endpoint and one blue endpoint. Two $BR$-matchings are compatible if their union is also plane. The \emph{transformation graph of $BR$-matchings} contains one node for each $BR$-matching and an edge joining two such nodes if and only if the corresponding two $BR$-matchings are compatible. In SoCG 2013 it has been shown by Aloupis, Barba, Langerman, and Souvaine that this transformation graph is always connected, but its diameter remained an open question. In this paper we provide an alternative proof for the connectivity of the transformation graph and prove an upper bound of $2n$ for its diameter, which is asymptotically tight.

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

↑