to the length of their shortest edge. Trees of maximum degree four have smaller planar realizations, with polynomially bounded edge lengths and bounding boxes. See also Rectilinear minimum spanning tree, a minimum spanning tree with distances measured using taxicab geometry References External links EMST tutorial, mlpack documentation Spanning tree Geometric graphs