New Variants of Perfect Non-crossing Matchings

摘要

Given a set of points in the plane, we are interested in matching them with straight line segments. We focus on perfect (all points are matched) non-crossing (no two edges intersect) matchings. Apart from the well known MINMAX variant, where the length of the longest edge is minimized, we extend work by looking into different optimization variants such as MAXMIN, MINMIN AND MAXMAX. We consider both the monochromatic and bichromatic versions of these problems and by employing diverse techniques we provide efficient algorithms for various input point configurations.