French
DeutschFile:Regular polygon Euclidean Steiner tree.svg
Size of this PNG preview of this SVG file: 400 × 600 pixels. Other resolutions: 160 × 240 pixels | 320 × 480 pixels | 512 × 768 pixels | 682 × 1,024 pixels | 1,365 × 2,048 pixels.
Original file (SVG file, nominally 512 × 768 pixels, file size: 14 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description | 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. |
| Source | Own work |
| Author | Cmglee |
Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- 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. |
You may select the license of your choice.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 14:26, 6 October 2023 | | 512 × 768 (14 KB) | Cmglee | Unitalicise variables to work around rsvg bug regression https://phabricator.wikimedia.org/T97233#8977673 |
| 00:34, 10 November 2019 |  | 512 × 768 (14 KB) | Cmglee | Align text. | |
| 16:57, 24 October 2019 |  | 512 × 768 (15 KB) | Cmglee | Add comparisons. | |
| 10:30, 24 October 2019 |  | 512 × 768 (13 KB) | Cmglee | Move viewBox. | |
| 10:26, 24 October 2019 |  | 512 × 768 (13 KB) | Cmglee | {{Information |description ={{en|1=Minimum spanning trees of (shortest networks connecting) vertices of regular polygons with 3 to 6 sides by CMG Lee. Squares represent Steiner points. The shortest network for n > 5 is the circumference less one side. }} |date = |source ={{own}} |author =User:Cmglee }} Category:Spanning trees |
File usage
The following 3 pages use this file:
Global file usage
The following other wikis use this file:
- Usage on id.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on ro.wikipedia.org
