Next week, Perouz will recap our best bounds on the “Matching point with things” problem: given a set of points and of geometric objects, is it possible to draw non-crossing segments connecting each point to its corresponding object?
We studied this problem, but there is still a lot to improve, in particular the complexity of some of our algorithms is far from tight.
