2 papers
cs.CG2020
New variants of Perfect Non-crossing Matchings
Ioannis Mantas, Marko Savić, Hendrik Schrezenmaier
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 intersec…
cs.CG2016
Faster Bottleneck Non-crossing Matchings of Points in Convex Position
Marko Savić, Miloš Stojaković
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matchi…