Colored Non-Crossing Euclidean Steiner Forest

Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3

Given a set of $k$-colored points in the plane, we consider the problem of finding $k$ trees such that each tree connects all points of one color class, no two trees cross, and the…