Hi,
I think (=hope) that eventually I will find a solution to this but I’m just posting it just in case somebody can help me get there faster:

I created a cube of cubes (5 by 5 by 5) but since it was created with box array it is a flat list. Since I want to map colours onto each cube, I need a tree of the form {5;5}(5) *where 5 is the paths/indexes count.

So, I have two (and a half) questions:

how can I do it with pathmapper?

can you use mathematical operations in pathmapper? for example: {A;B}(i)—> {sqrt(A);B}(i)
2.1- If so, is there some syntax for higher order roots? (sqrt is “square root”, but is there a “cube root” syntax?) CubeRoot.gh (5.0 KB)

Take the long way home and be a happy bunny (BTW: that’s 3 lines of code: your first DataTree C# mini def after 6 months from now). in our trade the long way is ALWAYS trhe short one.
.

Path mapper is static (meaning that he can’t adapt to dimension alterations that occur in 99% of real-life defs/cases). For the stuff that you are after I would suggest to avoid it when possible.

Kim,
As usual you delivered your magic!
but I didn’t make myself clear: I want to map rgb values to xyz values of the small cubes’ centers.

Here is my file as it is now, it’s chaotic (but that only reflects my understanding of the problem )
I managed to create two trees of 125 values that should give a good result but it does not!

Spot on!
I didn’t know how to express it, as the concepts are still fuzzy in my head! nevertheless, since I cannot afford to stay non-productive until (and a very big “if”) I become a programming guru like you, I need to know these tools!

You’re the man!
thanks Joseph!
I was thinking about it in terms of making two trees coincidie in their 'architecture’
you simplified it a lot by just by inferencing each item’s coordinates!
I feel stupid now…