2 papers
cs.CG2026
How Close is a Tree to a Euclidean Minimum Spanning Tree?
Todor Antić, Jiří Fiala, Jelena Glišić +8
Let be a straight-line crossing-free drawing of a tree . A \emph{bad pair} in is a pair of non-adjacent vertices of whose Euclidean distance in is smaller than t…
cs.CG2026
How many times can two minimum spanning trees cross?
Todor Antić, Morteza Saghafian, Maria Saumell +3
Let be a generic set of points in the plane, and let be a coloring of in two colors. We are interested in the number of crossings between the minimum spanni…