Follyx Posted September 19, 2021 Share Posted September 19, 2021 I found this file wich is in the atachement. How does this work? I mean where are the function for deleting the spheres wich intersect each other? Is it the job from the intersection anlysis? But if so, where is the connected Output from the intersection analysis? I really dont understand the logic behind this scene. Who could give me a hint / explanation please? untitled.hip Quote Link to comment Share on other sites More sharing options...
konstantin magnus Posted September 19, 2021 Share Posted September 19, 2021 Hey @Follyx, this is essentially a dart throwing algorithm. The switch node decides whether the current sphere or the empty null is merged based on the number of points of the intersection analysis node. if(npoints('../intersectionanalysis2')>0,1,0) If its just about avoiding spheres to collide (and not arbitrary meshes) you can also watch these tutorials: Fill with Non-Overlapping Packed Instances : https://www.youtube.com/watch?v=XJ7QJOZcLJk SOP Solver Tutorial - Dart throwing algorithm: https://www.youtube.com/watch?v=Y1UC3T9l15U 3 Quote Link to comment Share on other sites More sharing options...
Follyx Posted September 20, 2021 Author Share Posted September 20, 2021 (edited) Phantastic, thank you. I didnt recognized the null way from the switch. Was deep in the loop involved that I missed everything outside... lol And thank you for the examples. Edited September 20, 2021 by Follyx Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.