Template:Regular polygon minimum spanning tree.svg: Difference between revisions

From Vigyanwiki
(Created page with "File:Regular polygon Euclidean Steiner tree.svg|thumb|{{{1|right}}}|Minimum Steiner trees of vertices of regular polygons with ''N'' = 3 to 8 sides. The lowest network lengt...")
 
 
(No difference)

Latest revision as of 12:17, 25 April 2023

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.