Started by rcallicotte, September 03, 2009, 04:21:12 pm
Quote from: Matt on September 08, 2009, 03:31:09 amI think it would have to be non-recursive, although I'd love to be proved wrong!An iterator function might help things a little...
Quote from: Volker Harun on September 08, 2009, 12:17:49 pmI used a linear setup with 8 'iterations' ... made the render work for 45 minutes ... any iteration beyond in that setup would make my machine very slow ... slow .... ..... slow.Else this is a Julia-Set with c = -0.125 + 0.785156 iSorry about the simple scene.
Quote from: cyphyr on September 08, 2009, 05:40:10 pmThis actually illustrates my point very well. As a node structure can be created almost identically by two or more people (early yet but I guess there's only a few ways of creating a "Julia set" nodally in TG); yes I can see that one of them could copyright the node setup if they wished, but what happens if someone later who has never seen the "copyrighted" one (its identical for all intents and purposes) chooses to share it? If I go and create a "Julia Set" node setup and publish it am I in any way stealing from Volker Horn. I don't "feel" I am and I certainly wont be limited in my artistic expression but I would not want to be the cause of any harm.
Quote from: pfrancke on September 08, 2009, 06:29:48 pmAs a side note, during the 80's in an effort to stifle spaghetti code (resulting mostly from uncontrolled "goto" branches), this fellow by the name of Yourdon argued all logical problems could be defined and solved in code by using three constructs. The are sequence, decision, and iteration. I think he made a lot of money selling structured programming. Sometimes I think that it is the concept of how TG works that throws me so badly, having been a programmer, I want to visualize what TG is doing in programmer terms (or rather in constructs that I've grown accustomed to in a variety of different languages) and it obviously is its own animal with its own madness.