Talk:Fractal tree: Difference between revisions
Content added Content deleted
(→J Explanation: new section) |
m (spelling) |
||
| Line 108: | Line 108: | ||
This makes all values in P positive. For good measure, I add another 10 pixels to keep the tree off the top and left edge of the form. |
This makes all values in P positive. For good measure, I add another 10 pixels to keep the tree off the top and left edge of the form. |
||
Now, every time the form needs to be refreshed (which includes when it is first rendered), the |
Now, every time the form needs to be refreshed (which includes when it is first rendered), the tree gets drawn. |
||
Going further (randomness): If I wanted to introduce randomness, L would need to have one row for every row of A. I believe I would first compute L's random values in parallel with a different random value for each value in A. Then, I would partition each column based on the number of repeats for that segment and I would pick an arbitrary value from within the partition. Finally, I would compute running products along the rows to match the C implementation's approach. |
Going further (randomness): If I wanted to introduce randomness, L would need to have one row for every row of A. I believe I would first compute L's random values in parallel with a different random value for each value in A. Then, I would partition each column based on the number of repeats for that segment and I would pick an arbitrary value from within the partition. Finally, I would compute running products along the rows to match the C implementation's approach. |
||