Home
Random
Nearby
Log in
Settings
Donate
About Wikipedia
Disclaimers
Search
Template
:
Regular polygon minimum spanning tree.svg
Template
Talk
Language
Watch
Edit
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.