Return to Answer

• Combine two position nodes from different mesh primitives inside a geometry node tree
• Raycast + Align Euler to Vector. Wrong Hit Normals
• Understanding how "vertex of corner" works in geometry node

• Combine two position nodes from different mesh primitives inside a geometry node tree
• Raycast + Align Euler to Vector. Wrong Hit Normals
• Understanding how "vertex of corner" works in geometry node
• Passing Data Into Simulation Zone

This will be a third post in my series on how to read geonode trees:

Combine two position nodes from different mesh primitives inside a geometry node tree

Raycast + Align Euler to Vector. Wrong Hit Normals

In both of those I recommend reading the node tree ⬅ from right to left, however there is a limitation within which you can read fragments from left ➡ to right: a circular socket 🟣 generates a single value (it's calculated for each tree user once per frame), so it calculates a value based only on inputs from left, regardless of what is connected to the outputs on the right. The only caveat is such a node won't run at all if it's not connected (directly or indirectly) to the Group Output - but it hardly matters, due to the purely functional programming nature of geonodes; there are no side effects (other than performance related: memory usage, execution time, crash risk), so you can reason about your node tree by assuming every such node actually runs.

This will be a third post in my series on how to read geonode trees [links at the bottom]. In both previous I recommend reading the node tree ⬅ from right to left, however there is a limitation within which you can read fragments from left ➡ to right: a circular socket 🟣 generates a single value (it's calculated for each tree user once per frame), so it calculates a value based only on inputs from left, regardless of what is connected to the outputs on the right. The only caveat is such a node won't run at all if it's not connected (directly or indirectly) to the Group Output - but it hardly matters, due to the purely functional programming nature of geonodes; there are no side effects (other than performance related: memory usage, execution time, crash risk), so you can reason about your node tree by assuming every such node actually runs.

More reading:

• Combine two position nodes from different mesh primitives inside a geometry node tree
• Raycast + Align Euler to Vector. Wrong Hit Normals
• Understanding how "vertex of corner" works in geometry node