28 citations · 62 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CG2015
Colored Non-Crossing Euclidean Steiner Forest
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of -colored points in the plane, we consider the problem of finding trees such that each tree connects all points of one color class, no two trees cross, and the…
cs.CG2015★ 3 cited
On Monotone Drawings of Trees
Philipp Kindermann, André Schulz, Joachim Spoerhase +1
A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a mon…