So i need to subtract the intersected part of the cubed points from the other, i was thinking maybe a vector distance calculation, to calculate the shortest vector length between each point and maybe use a compare node, but i am really new to this and would appreciate someone to show me how its done, thanks.
$\begingroup$
$\endgroup$
Add a comment
|
2 Answers
$\begingroup$
$\endgroup$
1
...I was thinking maybe a vector distance calculation, to calculate the shortest vector length between each point and maybe use a compare node...
I think you're heading in the right direction with that idea, here are some pointers to help you achieve the rest of the solution.
For this case, using Geometry Proximity node will be an ideal approach since your goal is to find the intersected parts where the points on the two Cube objects meet (the area where the points are closets to each other -> they'll have the shortest distance). Geometry Proximity will do this automatically for you (it'll find the closet point on the targeted object, calculate the distance from the original/source points to the points on the targeted object and give you an distance output to use)
Once you'll get the distance/length between every two points that are on both of your Cube point objects, you can start to use the Compare node to separate non-intersected and intersected part from the original geometry.
The result:
Points that have smaller radius indicate the intersected section.
The intersected section.
The non-intersected section.
Here's the node setup. You can also throw in another custom node group that shows different parts of your geometry: Original - Non-Intersected - Intersected which can come in handy later on in case you still want to reuse it.
I also attached the blend file in case you want to examine it yourself later on.
-
$\begingroup$ thank you, i found this very helpful:) $\endgroup$ Commented Apr 1, 2022 at 18:21
$\begingroup$
$\endgroup$
You may as well solve this by creating a convex hull around one cube and check for each point of the other cube, if it is within the convex hull by using raycasts.
And this is, how the Is Point in Object node looks like:
I already described this node here: How can you fill one mesh's volume with as many of another mesh that will fit?
