• Johnny Mauser

    There is [gate] from cyclone for this purpose:

    Bildschirmfoto 2020-04-06 um 23.03.49.png

    posted in technical issues read more
  • Johnny Mauser

    @paleontologist i didn*t follow your post all the way, but generally [vd~] (variable delay) is a good object for pitch-vibrato

    posted in technical issues read more
  • Johnny Mauser

    @Il-pleut i really like the "Gesticulation Tubulaire"!

    posted in output~ read more
  • Johnny Mauser

    Maybe [pix_delay]?

    posted in pixel# read more
  • Johnny Mauser

    Maybe check out timbreID. I never used it intensivly so can not give more exact advice.

    posted in technical issues read more
  • Johnny Mauser

    @jona thx for your answers, inputs and solutions! testing and refining has to wait a little till i have time from my main tasks

    posted in technical issues read more
  • Johnny Mauser

    @jona no, i didn't implement that collision (hehe) detection. It is not so important, as the main goal was to not have the audiance walk through the evening with their peer group. This is allready ensured through the random drawing of [urn]. But the more the thing is juicing arround the more questions come:

    1. our both solutions have very different ERROR numbers with the same settings. i didn't understand your path yet, so it might be due to design differences.
    2. my "app" doesn't give the suspected answer: I have 200 people in 19 stages with total 213 seats, so should it not be possible to find a solution where nobody is twice at a given stage? my programm does not find an answer yet. (maybe i have to make it faster, so it can check out more possibilities in less time)
    3. i send the people through all stages one after another. That must lead to a structure where in the early time-slots the last stages are not used at all (given 200 people and 213 seats)
      -> my recursion is only that if there is an ERROR the hole process starts again, in theory it should be possilbe to make "smaller" recursions to same computing time. And the order of stages should alter, so that the last one does not get depreciated like it is now.
      Does your programm have different approaches?

    posted in technical issues read more
  • Johnny Mauser

    @jona i updated the patch above a little, so it becomes a little more usable. Open hide-GUI.pd set the tick in the [tgl] and presse the bang. Than it should random retry till it found a solution. The solution you can look at in the data window right clicking properties you can see the data. The first (0) entry in each array is the audiance nr (person nr) and than there are stages to visit in each time slot. I can see problems in my patch: i will start with room 1 and if that is full it is sending the "asking person" to the next room. And if the person finds a home there it will stay. Thats must result in a priority by the first rooms. and i am not sure yet whether i like that. I will also look at your attempt!

    posted in technical issues read more
  • Johnny Mauser

    @ingox thanks for this insight in [text]. @Jona allready showed some way for the original task in this thread. Your examples of write and read look quite simple indeed; probably this would have been easier than my atempt with DataStructures. Anyway i have a hope to visualize it with the DataStructures as well. Maybe this would also have been easier with [text] because it seems i have to retrieve all the data from the arrays anyway before being able show it.

    posted in technical issues read more
  • Johnny Mauser

    I have a working version now. Maybe i should have posted a version where it was not that messy yet. Too late. Here is what i have and use till now: open-hide-GUI.zip
    The grafical representation is not working yet. Actually i don't need it, but i would be nice to visualize the audiance flow. therefor i would need to draw the data of the arrays, not with [plot] but with filledpolygone or drawnumber. Is it posible to send messages to drawnumber to change its creation arguments?
    EDIT: Update, little better performace, actual usable

    posted in technical issues read more
  • Johnny Mauser

    @kyro i think it works now like you sugested (still not too sure with pointers). I "needed" to use append, even though i dont want to append anything, console gives me an error, but still the pointer is correct. And after setup, i can use the [traverse window, next( to retrieve the data.
    @jona the list-store is interesting and would have been usefull if i had not nested the arrays i think.

    posted in technical issues read more
  • Johnny Mauser

    Dearest Pd crowd,
    it is finaly time for me to learn some data structures! I need a structure where i have a nested array:
    (array1 (array2(float)))
    array1 should have 200 slots of
    array2, needs 10 slots of
    float
    the setup seems to work, but somehow i can not set, or get a number out of my structure.
    May someone enlighten me? I hope you can follow with this:
    nestedArrays.pd

    EDIT: setting the number like in the patch seeams to work. I can see it right clicking the properties of the structure in the data window. But retrieving it is not working. Am i doing something wrong with the pointer??

    posted in technical issues read more
  • Johnny Mauser

    @Jona, thank you for the patch! It seems to work. Only seems, because it is a little time consuming for me to follow your calculations. It is stuck in my head to try it with data structures 'cause i also think i could visualize it that way. Right now i am struggeling with nested arrays there, so i will make a new thread for the technical questions, and post here if i have an attempt of a solution. If i will not get anywhere, i will study your patch more closely, with the goal to abstractify it for general use.

    posted in technical issues read more
  • Johnny Mauser

    Yeah!! Just saw the reply. Will look into it tomorrow.

    posted in technical issues read more
  • Johnny Mauser

    @Jona there is the possibility to "print" a patch as a post scipt document

    posted in this forum read more
  • Johnny Mauser

    @Jona if i understand you correct i had thought of a similar logic you discribe. You mean the [text] object to hold all the information? do you know data structures? i had thought of each audiance member getting an array of time slots and than if he/she/it visits a stage (randomly with [urn] for example) he gets compared against 1) if she has been there, 2) the capacity 3) other audiance members and where they have been. and if she is not allowed to stay she has to knock at the next rooms door. And if the round has no solution the round has to go for another random starting point.
    And do you mean with the "timetable/stage x/y matrix" that this matrix has a third dimension for the audiance members? This 3 dimensional matrix could / should be able to discribe the whole show!? It would be interesting to see this visualized as well.
    Is it possible to do it with KI ( [ann] objects ??) also?

    posted in technical issues read more
  • Johnny Mauser

    Hi Pd friends,

    I have the following problem:
    I am part of an Installation for 200 people. I need to calculate the audiance flow. The installation has 19 places/stages where a different amount of people will fit in (from 1 to 25). And there are 10 time slots. Now i want to hand every person a card which place at what time they have to visit. There are different atributes each stage has. Some stages can be visited only once, some can be visited twice, but not at timeslots 1 + 2 but 1 + 4 for example. And some other atributes, like you should not be together in a stage with the same audiance member twice (this is a very weak attribute - meaning it is not too bad if it has to happen).
    How can this be calculated? I have the feeling it is finally time to learn data structures for me!
    I was thinking every person get a structure of a template [struct audiance float person nr array time-slots slot] and than the the rooms need to be an abstraction of some kind, which can have different arguments. and than there needs to be a recursive method to distribute the audiance. Somehow i had to think of the autoroot funktion in Eagle to find pathes for electrical wires on a circuit board. Is the challange understandable? What do you think?
    best, Jonas

    posted in technical issues read more
  • Johnny Mauser

    @whale-av yeah, that could be a way! Thanks for the idea

    posted in technical issues read more
Internal error.

Oops! Looks like something went wrong!