This should be the end result where 2 of the meshes are separated and the geometry is filled.
onesilentbird
Have you tried doing the Boolean difference of the original mesh and it’s Boolean Union with itself (with self intersection enabled)? To shrink/smooth the final result you can subdivide it.
hello, here three different fast concept ideas, hope it helps.
ps: and boolean one
Thank you. I tried making it work with booleans to a degree of success. It works great for individual pairs like the 2 cubes but I didn’t manage to make an algorithm that would sort it for all parts and “pairs” of the mesh. E.g the first boolean will work for the mesh being unioned with another boolean but it will neglect the other mesh boolean with this mesh.
Hello! Amazing node set-up. It’s exactly the result that I was solving to achieve. The third method you showed looks to be the simplest and most accurate out of them 3.
I am curious about your process for the first and second, how is utilizing the dot product from the ray cast gives us the areas we want to have deleted?
Dot product? I cannot explain it better than it is here - that was my learning process start as well… Vector Math made easy in Blender and Geometry Nodes - CG Cookie
