双色兼容匹配
Bichromatic compatible matchings
摘要:
对于$n$红色点的集合$R$和$n$蓝色点的集合$B$,$BR$匹配是非交叉几何完美匹配,其中每个段具有$B$中的一个端点和$R$中的一个端点。如果两个$BR$匹配的并集也是非交叉的,则它们是兼容的。证明了对于任意两个不同的$BR$ -匹配$M$和$M'$,存在一个$BR$ -匹配序列$M = M_1, ..., M_k = M'$使得$M_{i-1} $与$M_i$相容.这意味着相容双色匹配图的连通性,它包含一个结点和一条连接每对相容匹配的边,从而回答了Aichholzer等人在“Compatible matchings for bichromatic plane straight line graphs”中提出的公开问题
英文摘要:
For a set $R$ of $n$ red points and a set $B$ of $n$ blue points, a $BR$-matching is a non-crossing geometric perfect matching where each segment has one endpoint in $B$ and one in $R$. Two $BR$-matchings are compatible if their union is also non-crossing. We prove that, for any two distinct $BR$-matchings $M$ and $M'$, there exists a sequence of $BR$-matchings $M = M_1, ..., M_k = M'$ such that $M_{i-1} $ is compatible with $M_i$. This implies the connectivity of the compatible bichromatic matching graph containing one node for each bichromatic matching and an edge joining each pair of compatible matchings, thereby answering the open problem posed by Aichholzer et al. in "Compatible matchings for bichromatic plane straight-line graphs"
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。