number of divisions on that curve as in the defintion (i.e. by 4). The offset in the def is slightly different and should cull two or three more curves as in the lists that show my aim below.
Basically I want to look into each branch of the groups of points from each closed curve . Marking in a list whether it contains a one or a zero (0= outside 1 = coincidents).
{0;0}0. 21. 22. 23. 2 {0;1} 0. 01. 22. 03. 2 {0;2}0. 01. 02. 03. 0 {0;3}0. 21. 22. 23. 2 {0;4}0. 21. 22. 23. 2 {0;5}0. 21. 22. 23. 2 {0;6}0. 01. 22. 23. 1 {0;7}0. 21. 22. 03. 0 {0;8}0. 21. 22. 23. 2 {0;9}0. 21. 22. 23. 2 {0;10}0. 21. 22. 23. 2 {0;11}0. 21. 22. 23. 2 {0;12}0. 21. 22. 23. 2 {0;13}0. 01. 22. 23. 0 {0;14}0. 21. 22. 23. 2
I want to create a list from these points. That marks each curve that pokes out, in a cull pattern as such:
20022210222202
Using a 1 where there are co-incidents in the curve points and the boundary. A 2 for true (outside points) and a 0 for containment. So I might be able to use the 1 in future developments - however if a true false list is easiest I can live with that.
So could I use F(x) function? - to look for 0 or 1's in each bunch of points and thus list as such for a cull pattern? or will Path mapper help me here? Or can I rely on simply grafting and splitting??
I am usure of the neatest solution and would love to learn. Hope you can direct me.rgrds
J.…
W, X, Y, Z}
----------------------------------------
and if I set this
SetA = {U, V, W, X, Y, Z}
SetB = {1, 2, 3}
Imap = {2, 2, 2}
I will get this?
result = {U, V, 3, 2, 1, W, X, Y, Z}
----------------------------------
And what if I set this?:
SetA = {U, V, W, X, Y, Z}
SetB = {1, 2, 3}
Imap = {2, 2}…
Added by Frane Zilic at 3:26pm on September 10, 2010
What are B and C supposed to be? I mean, they have to resolve to actual numbers.
So given the tree:
{0} [0;1;2;3]
{1} [0;1;2;3]
{2} [0;1;2;3]
{3} [0;1;2;3]
What is it you're after?
Added by David Rutten at 8:59am on October 21, 2017