Hello! i also found this app by hisschemoeller very inspiring. i looked at your examples and found the solutions with writing the steps into an array quite easy and straight forward, compared to the effort needed when using lists. the patterns actually look the same, compared to the ones created in hisschmoellers`flash app and the distribution is just mirrored. so just changing the read-direction of [counter] and there you are.
peter
-----Ursprüngliche Nachricht----- Von: "martin brinkmann" mnb@martin-brinkmann.de Gesendet: 26.05.2011 11:41:49 An: "Martin Dupras" martindupras@gmail.com Betreff: Re: [PD] euclidean rhythms
On 05/26/2011 01:29 AM, Martin Dupras wrote:
In other words: let's say you want 5 beats in a grid of 12 (or a 12-sided polygon, if we use his graphical representation), the exact spacing between two beats would be 12/5, or 2.4.
The first beat would be 0*2.4= 0. The second beat would 1*2.4 = 2.4, rounded to 2 The third would be 2*2.4 = 4.8, which we round to 5. The fourth would be 3*2.4= 7.2, which we round to 7. The fifth would be 4*2.4 = 9.6, which we round to 10.
We now have the pattern x.x..x.x..x.
though the flash app (at hisschemoeller.com) produces soemthing like x..x..x.x.x. the number and length of rests is the same in this case, but the distribution is different. if you, instead of rounding, just cut the fractional part, you get the same result as the flash app, only mirrored, but this seems not to work for other numbers.
i have attached my own quick and dirty itterative attempt, but i think it should also be possible to implement with operations on lists, like in the ruinwesen example. but i am not that familliar with this in pd...
bis denn! martin
I forgot to tell that [list-tuplet] is an abstraction available here:
http://megalego.free.fr/pd/patko/list-sequence/list-tuplet.pd http://megalego.free.fr/pd/patko/list-sequence/list-tuplet-help.pd
----- news@petervenus.de a écrit :
Hello! i also found this app by hisschemoeller very inspiring. i looked at your examples and found the solutions with writing the steps into an array quite easy and straight forward, compared to the effort needed when using lists. the patterns actually look the same, compared to the ones created in hisschmoellers`flash app and the distribution is just mirrored. so just changing the read-direction of [counter] and there you are.
peter
-----Ursprüngliche Nachricht----- Von: "martin brinkmann" mnb@martin-brinkmann.de Gesendet: 26.05.2011 11:41:49 An: "Martin Dupras" martindupras@gmail.com Betreff: Re: [PD] euclidean rhythms
On 05/26/2011 01:29 AM, Martin Dupras wrote:
In other words: let's say you want 5 beats in a grid of 12 (or a 12-sided polygon, if we use his graphical representation), the
exact
spacing between two beats would be 12/5, or 2.4.
The first beat would be 0*2.4= 0. The second beat would 1*2.4 = 2.4, rounded to 2 The third would be 2*2.4 = 4.8, which we round to 5. The fourth would be 3*2.4= 7.2, which we round to 7. The fifth would be 4*2.4 = 9.6, which we round to 10.
We now have the pattern x.x..x.x..x.
though the flash app (at hisschemoeller.com) produces soemthing like x..x..x.x.x. the number and length of rests is the same in this case, but the distribution is different. if you, instead of rounding, just cut the fractional part, you get the same result as the flash app, only mirrored, but this seems not to work for other numbers.
i have attached my own quick and dirty itterative attempt, but i think it should also be possible to implement with operations on lists, like in the ruinwesen example. but i am not that familliar with this in pd...
bis denn! martin _______________________________________________ Pd-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
-
news＠petervenus.de -
Patrice Colet