English: Minimum Steiner trees of (shortest networks connecting) vertices of regular polygons with N = 3 to 8 sides by CMG Lee. Squares represent Steiner points. The lowest network length L for N > 5 is the circumference less one side.
Português: Árvores de Steiner mínimas de vértices de polígonos regulares com N = 3 a 8 lados por CMG Lee. Os quadrados representam os pontos Steiner. A extensão minima L para N > 5 é o perímetro menos um lado.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
You may select the license of your choice.
Captions
Add a one-line explanation of what this file represents
This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.
If the file has been modified from its original state, some details may not fully reflect the modified file.
Short title
Regular polygon minimum spanning tree
Image title
Minimum Steiner trees of (shortest networks connecting) vertices of regular polygons with N = 3 to 8 sides by CMG Lee. Squares represent Steiner points. The lowest network length L for N > 5 is the circumference less one side.