I have an object with a number of children. For every child I want to generate a list of neighboring children. Two children are neighbors if the minimum distance between them is 0 (they touch). There are no intersections. What's the best way to approach this in cq?
Hi,
I have an object with a number of children. For every child I want to generate a list of neighboring children. Two children are neighbors if the minimum distance between them is 0 (they touch). There are no intersections. What's the best way to approach this in cq?
Best