mNo edit summary |
|||
Line 36: | Line 36: | ||
[[Media:AA_L1_BrownianMotion.pde| AdjustedBrownianMotion]]<br> <br> | [[Media:AA_L1_BrownianMotion.pde| AdjustedBrownianMotion]]<br> <br> | ||
Taking the basic algorithm for Brownian Motion as a format, additional interactions are introduced in order to develop a better understanding of Array methods. While lines are drawn from the calculated 'random' motion which comes from the basic Brownian motion, the color of lines are incrementally manipulated and the fading affect of the background is toggled upon mousePressed(). Additionally, triangles are drawn at the end of the pointList, and the centroid of the 2D triangles are calculated and indicated with a point. | Taking the basic algorithm for Brownian Motion as a format, additional interactions are introduced in order to develop a better understanding of Array methods. While lines are drawn from the calculated 'random' motion which comes from the basic Brownian motion, the color of lines are incrementally manipulated and the fading affect of the background is toggled upon mousePressed(). Additionally, triangles are drawn at the end of the pointList, and the centroid of the 2D triangles are calculated and indicated with a point, and a curve is drawn via vertex points from the Brownian Motion points. | ||
<br> | <br> | ||
|- | |- | ||
|} | |} |
Revision as of 12:02, 31 October 2018
Human Processed Algorithm 1 // 261018
Result | Algorithm |
---|---|
Human Processed Algorithm 1 Inspiration // Recursion
As a source of inspiration, architectural examples of recursive operations within facade design, such as LAVA : KACST HQ, form a basis for environmental and aesthetic building design, but the inclusion of personal data adds an additional layer of complexity. Following a basic level of recursion, the question of human ease was a driver in the specific operations which take place. The thought being, 'if the algorithm is too mathematically complex, then why not just have a computer act as operator', the instructions and dimensions were orchestrated into a regimented set of operations, while never crossing the line of expecting time-consuming computations to take place.
|
Algorithms for Computers 1 // 021118
Result | Algorithm |
---|---|
|
ReactiveGridCells AdjustedBrownianMotion
|