Bottleneck Non-Crossing Matching in the Plane

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz +1

Let $P$ be a set of $2n$ points in the plane, and let $M_{\mathrm{C}}$ (resp., $M_{\mathrm{NC}}$) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of $P$. We study th…