Linear transformation distance for bichromatic matchings

Aichholzer, 2014, Linear transformation distance for bichromatic matchings, 154 Aichholzer, 2009, Compatible geometric matchings, Comput. Geom., 42, 617, 10.1016/j.comgeo.2008.12.005 Aichholzer, 2011, Compatible matchings in geometric graphs, 145 Aichholzer, 2012, Compatible matchings for bichromatic plane straight-line graphs, 257 Aloupis, 2015, Bichromatic compatible matchings, Comput. Geom., 48, 622, 10.1016/j.comgeo.2014.08.009 Asinowski, 2015, Quasi-parallel segments and characterization of unique bichromatic matchings, J. Comput. Geom., 6, 185 Borsuk, 1933, Drei Sätze über die n-dimensionale euklidische Sphäre, Fundam. Math., 20, 177, 10.4064/fm-20-1-177-190 Chazelle, 1994, Ray shooting in polygons using geodesic triangulations, Algorithmica, 12, 54, 10.1007/BF01377183 Eppstein, 1999, Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions, Discrete Comput. Geom., 22, 569, 10.1007/PL00009479 1997 Hoffmann, 2014, Vertex-colored encompassing graphs, Graphs Comb., 30, 933, 10.1007/s00373-013-1320-1 Hurtado, 2008, Encompassing colored planar straight line graphs, Comput. Geom., 39, 14, 10.1016/j.comgeo.2007.05.006 Ishaque, 2013, Disjoint compatible geometric matchings, Discrete Comput. Geom., 49, 89, 10.1007/s00454-012-9466-9 Ishaque, 2012, Shooting permanent rays among disjoint polygons in the plane, SIAM J. Sci. Comput., 41, 1005, 10.1137/100804310 Kaneko, 2003, Discrete geometry on red and blue points in the plane—a survey, vol. 25, 551 Larson, 1983 Lo, 1994, Algorithms for ham-sandwich cuts, Discrete Comput. Geom., 11, 433, 10.1007/BF02574017 Matoušek, 2007, Using the Borsuk–Ulam Theorem Razen, 2008, A lower bound for the transformation of compatible perfect matchings, 115 Sharir, 2006, On the number of crossing-free matchings, cycles, and partitions, SIAM J. Comput., 36, 695, 10.1137/050636036