Leaderboard

#CGGG 003 | Fractal Subdivision

I find the A* algorithm faster. Of couse the implementation is much more complicated... Found a very informative video about shortest path finding algorithms Although subjectively if you need to find the shotest path you'd need to apply A*, Dijkstra's is more convenient for our line of work when you need to depict more natural phenomena... Both useful for different applications.

After Blender got its own Shortest Path Geometry Node last year, many C4D users were anxiously waiting for a counter-move by MAXON. R2023 did not introduce a similar effect but brought an even longer awaited Pyro. Although it is still possible that the Spring release of C4D could introduce its own Shortest Path generator nothing is for certain as MAXON keeps its secrets well hidden (unless Dave McGavran 😜 says otherwise). User 5698024877226 A.K.A Dominik Ruckli, has made his own python plugin and shares it for free here with a SceneNodes particle emitter .

Hi! Sharing a variety of quick tips with you - Try, learn, experiment! - Ask questions. - Share your results.

Or just move to a render engine that doesn't kill your system whilst its in use. I use after effects, photoshop, premiere and continue working in c4d whilst octane renders all on a single card every day.

This sort of format and topics would be fantastic, and with the modelling project attached would be great fun. Also, Zelda is cool. Great idea Igor.

Rubber band 57_Rubber_band(CA).c4d

A 3070 is currently £500, has 8 GB and has an octane bench score of ~400 A 3090 has currently £1000. has 24 GB and has an octanebench score of ~700 Considering OS and 3d app overhead, you're really looking at 4gb of usable gpu memory vs 20gb. By the time you consider redshift inefficiencies and the overheard of sending data to 2 cards, they will be about the same speed. But the 3090 will have significantly more capability for larger projects and will last you longer.

If you guys make dedicated threads for recommended Houdini and Blender tut's, I'll make a strong effort to watch all of them and pop in with commentary as I go. I'll also post ones that I find useful.

For those who want to dive a little deeper into the logic of shortest path algorithm, a good explanation of what is considered one of the better algorithms (and there are many) is Dijkstras algorithm is found here. If you want to see an example of that algorithm in python code, then look here for some explanation or select the python tab at the bottom of the first link I provided. I looked this up because I wanted to know whether shortest path was calculated on a node-by-node basis (that is at each node point it only selects the nearest node) or whether there was some logic that looked at the overall path length because the actual shortest overall path may entail taking the longest path between any two individual nodes at some points. Pretty cool stuff. A neat application would be for creating industrial piping. Secondary step would be to then and fillets to every spline. Dave

#CGGG 002 | Surface Waves

#CGGG 001 | Laser Line