Algorithmische Komposition

Sergi Puig

VII. Interpolation + OMloop

The last few weeks I have been doing a lot of research on the Omloop function and different
aspects that can be created in it.

One of the interesting aspects of OpenMusic is when you start mixing different functions. In this
case, I tried to use a simple OmLoop sub-patch together with the "interpolation" function.

In this sub-patch, OmLoop receives all the previous

interpolation information in input 0 (we will see it in
the next example), while in input 1 we are going to
assign the number of notes it chooses for each
repetition.

"Nth-random" means that it chooses a random note

from the list it receives.

Here's how to apply this in a simple way with an interpolation between two chords.

First we see how the "interpolation" function worked.

We have a point A (midi-cent list) and point B (another midi-cent list).

Here it is important to note that the interpolation function will always relate the first value of the list
to the first value of the other list. So it is important the order of how we write our chord, if we want
a certain interpolation.

1
 Algorithmische Komposition Sergi Puig

Once we have configured the Omloop and the desired interpolation, we connect the
"interpolation" output to the Omloop, and assign the number of notes that "nth-random" will
choose from each chord of the interpolation.

Before we have the final result, the

“flat” function is important, because
otherwise Omloop would show all the
collected values in a single list (it
would show chords instead of
sequences of notes).

In the end we have the following result:

A random sequence of 7 notes for each chord of the interpolation ( in this case 11 steps ), so that
the melodic sequence in turn is interpolating between the two chords.

2
 Algorithmische Komposition Sergi Puig

VIII. BPF

BPF is the latest aspect I have been looking into at OpenMusic.

BPF is a function that allows you to work from graphical notation. The interesting thing is that you
can apply any graph to different musical aspects and OpenMusic allows you to work with and mix
many different functions (as we have seen before).

So basically what we are going to do is to assign a list of notes in a certain order for BPF to
convert into a graph.

We can assign the number of breakpoints that our graph is going to have and then we can work
on lowering or raising the resolution of that same graphical figure.

3
 Algorithmische Komposition Sergi Puig

One of the many interesting aspects of BPF, is that you can work on lowering or raising the
resolution of your graphic so that you can make small variations from the original graphic, or even
work as if it were a kaleidoscope effect.

For this in the following example I put a chord with the following order of notes, and that was the
graphical result.

Then I used the "om-sample" function.

As we can see, "om-sample" resamples the information it receives in the first input, and in the
second one we can increase or decrease the sample-rate, therefore the number of breakpoints
our graph will have.

The two input options are used to assign the start and end points of the graph where "om-
sample" works.

4
 Algorithmische Komposition Sergi Puig

As we can see in the last step, our initial graph is connected to "om-sample" and we raise the
resolution from 10 breakpoints (there are 10 notes in the chord) to 80.

We can see how the resulting graph has changed slightly, rounding off especially the tips.

In the final result we have a sequence of 80 notes with the same melodic contour of the initial
graph, but adjusted to the new resolution.

———