Image:Euclidean minimum spanning tree.svg

[edit] Summary

A Euclidean minimum spanning tree of a random set of 25 points in the plane. Produced by Derrick Coetzee in Mathematica 4.1.1.0 using the following commands:

  << DiscreteMath`Combinatorica`
  
  points = Table[{Random[], Random[]}, {x, 1, 25}]
  
  Export["z:\pictures\Wikipedia\emst.eps", 
    ShowGraph[MinimumSpanningTree[Graph[Table[
            Sqrt[(points[[i]][[1]] - points[[j]][[1]])^2 + (points[[i]][[2]] - 
                      points[[j]][[2]])^2], {i, 1, 25}, {j, 1, 25}], points]]]]

I then loaded the .eps in Illustrator, redrew it (original .eps had weird artifacts when saved as .svg), and saved out as an .svg. I place this image in the public domain and release all rights to it. This vector version replaces Image:Euclidean_minimum_spanning_tree.png.

[edit] Licensing

I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | ‪Norsk (bokmål)‬ | ‪Norsk (nynorsk)‬ | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | ‪中文(简体)‬ | ‪中文(繁體)‬ | zh-yue-hant | +/-

• Euclidean minimum spanning tree