Minimum Spanning Tree of Line Segments

摘要

In this article, we study a variant of the geometric minimum spanning tree (MST) problem. Given a set S of n disjoint line segments in R~2, we need to find a tree spanning one endpoint from each of the segments in