Template:Regular polygon minimum spanning tree.svg

From Vigyanwiki
Revision as of 12:55, 20 March 2023 by alpha>Indicwiki (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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.