I want to region-intersect two trees each carrying a bunch of closed polygons. List “A” (red curves) has e.g. 4 items, list “B” (blue curves) has different polygons but the same amount as list A. How can I region intersect each index across the two trees? E.g. index 0 (List A) with index 0 (List B), index 1 (List A) with index 1 (List B), index 2 (List A) with index 2 (List B)?

The attached file doesn´t give me the correct intersection for each item.

frage.gh (15.0 KB)