Experimenting with concepts of graphical links, of temporal (transitory) processes and the selection of catchwords from the »information flow«

Selected designs on the visualisation of the »information flow«, which give an impression of the developing process and the multitude of possible visual variations, can be found here. The examples are ordered according to the algorithms they are based on.

Algorithms are precisely defined mathematical calculations used to solve one specific problem or particular kinds of problems. They are defined by a finite set of rules that are employed one after the other and are often repeated according to definite conditions. The algorithms developed for the »information flow’s« visualisation determine in what way the data is transferred into graphic delineations. This affects for example the movement of the words, their position within the flow and graphic elements such as lines and circles.

The examples can be looked at with a Java Runtime Environment, which can be downloaded here.