33 point Spikey polyhedron via Thomson problem

33pointspikey.nb (444 KB)

11 Likes

Beautiful problem and solution, thanks for the demo and anniversary reminder! We also have have SpherePoints, that probably uses similar optimization methods (just guessing). And probably things like DelaunayMesh should help to find the polygons.

5 Likes

DelaunayMesh for 3D are creating tetrahedrons. So, it is directly maybe not applicable to this. I will have to look into this further if we can find ways of using tetrahedrons and not triangles. But I suspect, that in the process of making it simple in the first section, if I would be making it more complicated in the subsequent sections. If I can make something useful, I will definitely share. Thanks for the idea!

2 Likes

news-congrads-kkluyshnik-02-04-19.jpg – you have earned Featured Contributor Badge 2015-11-02_10-07-11.png
Your exceptional post has been selected for our editorial column Staff Picks http://wolfr.am/StaffPicks and Your Profile is now distinguished by a Featured Contributor Badge and is displayed on the Featured Contributor Board. Thank you!

1 Like

There should be (at least) one additional line of code:

poly:=...

I tryed to find it myself, but I couldn’t:)

3 Likes

‘poly’ should be replaced by ‘polygons’

2 Likes

Yes, the definition of ‘poly’ was missing, corrected now. Thanks to both of you.

2 Likes