Linear transformation distance for bichromatic matchings
Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber · 2014
Let P = B ∪ 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 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.