Given a set of disjoint line segments in the plane, a geometric encompassing graph is a graph whose vertex set is the end points of the segments. Its edge set is a superset of the line segments. Can one always construct a plane geometric encompassing tree of bounded degree? We will study this and related problems.