Take the 2-minute tour ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.

As we all know, Mathematica changes its logo design with every new version, while still maintaining the dodecahedral/icosahedral motif.

I have been able, through much digging around, to finally acquire the code for generating the logos corresponding to versions three, four, and five. I was able to obtain code for generating the version six logo from this blog post by Michael Trott (it is also available here).

However, I have not been so successful in finding code for the version two logo:

version 2 spikey

Some searching seems to indicate that there is code for this in one of the Mathematica Guidebooks by Trott, but the libraries I have access to do not have copies of these tomes. (Google Books will also not let me preview the pages where the code seems to be.)

I have also tried sending an e-mail to Michael Trott and Igor Rivin, but I have not gotten any response from them in three weeks, so it would seem that they are unable or unwilling to supply the code for generating the version two logo.

So, how might I generate the version 2 Mathematica spikey?

share|improve this question
    
(I had wanted to ask how to generate the logos for versions seven and eight as well, but maybe that is for another time and place...) –  Carlos Culo Feb 26 '13 at 6:19
    
I'm wondering is it legal to post the code from the book here? –  xslittlegrass Feb 26 '13 at 16:13
    
Michael Trott gave a nice 5min talk about an interactive spikey explorer two years ago at the WR Tech conference, not sure if this is anywhere to be found... –  Yves Klett Feb 27 '13 at 8:58
    
I included link to the code for 4,5 & 6. Can you include the link for 3? In case people are interested. –  Szabolcs Feb 27 '13 at 16:24

1 Answer 1

I don't know how he did it. There doesn't seem to be an equation in any of the papers. Based on the only equation for a hyperbolic polyhedron available ($x^{2/3}+y^{2/3}+z^{2/3}=1$ for the hyperbolic octahedron), I have attempted to reconstruct the transformation leading from Euclidean to hyperbolic polyhedra.

Construct a function that we know would take an octahedron to the given hyperbolic octahedron. The form is complicated, so compile it to save a lot of time.

rsol = r /. Solve[{(r a)^(2/3) + (r b)^(2/3) == 1}, r];
rconv = rsol /. 
  Thread[{a, b} -> {(1 + Sqrt[Abs[2 R^2 - 1]])/(2 R),
      (1 - Sqrt[Abs[2 R^2 - 1]])/(2 R)}]
rcomp = Compile[{{R, _Real}}, Evaluate[rconv[[2]]], 
  CompilationTarget -> "C", RuntimeOptions -> "Speed"]

This has singularities at a couple important points that we can remove.

rR[r_ /; Abs[r - 1] < 0.001] := 1.0;
rR[r_ /; Abs[r - 1/\[Sqrt]2] < 0.001] := 0.5
rR[r_?NumericQ] := rcomp[r]

Then we can use it to hyperbolicize:

hyperbolicize[cR_][p_] := 
 p /. Polygon[x_] :> Polygon[#/Norm[#] rR[Norm[#]/cR] & /@ N[x]]

The function depends on the circumradius, and we need to select a scheme for subdividing the faces of the basal dodecahedron. A couple iterations of facebreak and edgebreak does a nice job.

facebreak[p_] := 
 p /. Polygon[x_] :> (Polygon[Append[#, Mean[x]]] &) /@ 
    Partition[Append[x, First[x]], 2, 1]

edgebreak[p_] := 
 p /. Polygon[x_] :> 
   Polygon /@ (Append[
        Partition[RotateRight[Riffle[x, #]], 3, 2, 1], #] &[
      Mean /@ Partition[x, 2, 1, 1]])

Module[{poly = "Dodecahedron"}, 
 Graphics3D[{hyperbolicize[PolyhedronData[poly, "Circumradius"]]@
    Nest[edgebreak@facebreak@# &, 
     Normal@PolyhedronData[poly, "Faces"], 2]}, Boxed -> False]]

Hyperbolic dodecahedron

share|improve this answer
2  
Partition[Append[x, First[x]], 2, 1] is more compactly done as Partition[x, 2, 1, 1], while Mean /@ Partition[Append[x, First[x]], 2, 1] is better done as ListConvolve[{{1}, {1}}/2, x, -1]. Otherwise, I think this is a nice start; thanks! –  Carlos Culo Feb 26 '13 at 6:59
1  
Nice. Might look a bit more like the old one if you turn off anti-aliasing. –  s0rce Feb 27 '13 at 5:15

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.