Compatible Paths on Labelled Point Sets

Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8

Let $P$ and $Q$ be finite point sets of the same cardinality in ${\mathbb{R}}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$…