Which method is often used for making sift patterns (0,1,2,2,2,3,3,4)?


(Edward) #1

Which method is often used for making sift patterns (0,1,2,2,2,3,3,4)?
Or of which component tab I should think of?

Inefficient pattern method.gh (36.9 KB)


(David Rutten) #2

The Random component? I don’t think the answer has a question, there seems to be no logic to (0,1,2,2,2,3,3,4), so either it’s manually crafted to fit the problem at hand, or it’s random, or it’s the result of some custom logic in which case there’s no “often”.


(Aris Nikolopoulos) #3

I don’t know if this is helpful, but I’ve found that combining series components creates rich patterns:
I hope this is what you meant:
(by settinglongest list to ‘flip’ you can make the repeating pattern symmetrical)
shift pattern.gh (13.5 KB)


(Edward) #4

Thank you for your response.
I try to understand how people make patterns for sift component. For example…

I have 2601 points.

I want a list with 260 random points (10% list A)
I want a list with 320 random points (12% list B)
I want a list with 520 random points (20% list C)
And I want a list with the remaining points (list D)

They may not overlap each other.

It did not work out in my first trial (see my confusing message above (on top)). I have not find any good example yet.
I was thinking, maybe using many dispatches or a long line of components, but that would not be efficient.

Below is a better version wherein my goal is more clear.
Inefficient pattern method 2.gh (49.5 KB)


#5

Is this what you are after?

Inefficient pattern method 2_re.gh (27.2 KB)


(Tim Stark) #6

May like this?
inefficient_pattern.gh (10.5 KB)


(Edward) #7

How the cookiemonster !
Thank you :slight_smile:


(Edward) #8

How the cookiemonster !
Thank you :slight_smile: