On geometric independency trees for points in the plane (Q1850043)

A geometric graph is a graph drawn in the plane whose edges are straight-line segments. A plane spanning tree is a tree drawn in the plane so that its edges are closed straight-line segments and no two edges intersect internally, and no three of its vertices are collinear. This type of tree has been frequently studied, because its importance in computer science. This paper presents some interesting results about particular plane spanning trees.