Template:Regular polygon minimum spanning tree.svg

File:Regular polygon Euclidean Steiner tree.svg

Minimum Steiner trees of vertices of regular polygons with N = 3 to 8 sides. The lowest network length L for N > 5 is the circumference less one side. Squares represent Steiner points.