Acta 2011 3 4 STR 69 78
Acta 2011 3 4 STR 69 78
Acta 2011 3 4 STR 69 78
udc 004.92:519.216:655
original scientific paper
received: 22-08-2011
acta graphica 196 accepted: 22-11-2011
Authors
Maja Turčić¹*, Vilko Žiljak², Ivana Ž.–Stanimirović²
Polytechnic of Zagreb,
1
University of Zagreb,
2
Abstract:
With the emergence of new tools and media, art and design have developed into
digital computer-generated works. This article presents a sequence of creating art
graphics because their original authors have not published the procedures. The
goal is to discover the mathematics of an image and the programming libretto with
the purpose of organizing a structural base of computer graphics. We will elaborate
the procedures used to produce graphics known throughout the history of art, but
that are nowadays also found in design and security graphics. The results are close-
ly related graphics obtained by changing parameters that initiate them. The aim is
to control the graphics, i.e. to use controlled stochastic to achieve desired solutions.
Since the artists from the past have never published the procedures of screening
methods, their ideas have remained “only” the works of art. In this article we will
present the development of the algorithm that, more or less successfully, simulates
those screening solutions. It has been proven that mathematically defined graphi-
cal elements serve as screening elements. New technological and mathematical so-
lutions are introduced in the reproduction with individual screening elements to
be used in printing.
Keywords:
Stochastic Models, Computer Art Graphics, Screen Shapes, Security Graphics,
Design and Print
69
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
70
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
neers of such art in Croatia. First they made Many artists have in various ways tried to
their works using analogue methods, but as arrange screening elements and their cover-
technology developed, they themselves started age (Vladimir Bonačić-1969, Frieder Nake-1965,
using machines and programme languages Georg Nees-1965-1968, A. Michael Noll-1965,
to write in. They blended art and science and Manfred Robert Schroder-1968, Leon D. Har-
introduced the concept of research into their mon/Kenneth C. Knowlton-1966, David R. Gar-
works (Rosen, 2011). At that point the viewer rison-1968/69, Vilko Žiljak-1972) (Rosen, 2011).
could not longer tell the difference between an Technologies of phototypesetting from 1980s
artist and a scientist. Those works of art con- had relations in which an entire word could
tain in themselves recognisable routines that be used as a screening microelement (Žiljak,
detach them from personality and individu- 1987). Artists used to solve the problem with
ality. The first exhibition was held in 1961 in instances of individual expression and without
Zagreb showing experimental works of artists/ publishing procedures or algorithms for the
scientists that experiment with the visual and suggested technique. They did not go beyond
participate in the creation of a new dominant the mere presentation of their work of art.
art movement. New tendencies continued into
early 1970s, during which they showed efforts
to systematise and study the possibilities, thus
making their art primarily different from mere
“attempts”. Experiments are defined through
the methodology and planning of conditions
that are then studied. They resulted in repeat-
able works. This hypothesis is opposed to the
traditional concept of an artist as a spontane-
ous genius expressing themselves through art
(Moles, 1968).
71
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
PImage img;
int charCounter=0;
String s = “ONE PICTURE IS WORTH A THOUSAND WORDS “;
void draw()
{
noLoop();
img.loadPixels();
int x=0;
int y=0;
int rowCounter=0;
while(y<height)
{
while(x<width)
{
char currentChar=s.charAt(charCounter);
color col=img.pixels[y*width+x];
fill(col);
text(currentChar,x,y);
x+=textWidth(currentChar);
charCounter++;
if(charCounter>=s.length()) charCounter=0;
}
charCounter=0;
rowCounter++;
y+=8;
x=-rowCounter*360;
}
}
72
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
73
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
ent each time due to human errors, but the digi- sequence, we have built our own generators that
tal technology has introduced sterile uniformity are congruent due to their speed and simplicity,
of products. At the same time, a computer is an as well as high quality results. They are based on
ideal tool for generating stochastic variations, finding the remainder of the product of the two
hence providing freedom and the richness of preceding numbers. Particular attention should
expression, impossible for digital solutions. The be paid to the degeneration, i.e. too frequent
best examples are handwritten fonts that can- repetition of sequences or the transition to one
not look authentic without a stochastic variable. constant. Therefore, the best results are obtained
This was demonstrated by Donald E. Knuth if numbers ‘a’ and ‘m’ are prime numbers (Žiljak
in his Metafont Project that defined letters and & Smiljanić, 1980).
signs by mathematical curves and by introduc-
ing stochastics, all curves were changed leaving ri+1 = (ari + b) mod m (1)
the impression of authenticity (Knuth, 1986).
Congruent sequences always end in a loop;
Stochastics in computer programming is there is always a sequence that is repeated end-
based on random number generators. Some lessly. If b = 0, that sequence is shorter, but it is
programming languages themselves generate still possible to achieve that the sequence is long
parameters of congruence, and in some there enough. The sequence cannot be longer than
is not even an option for the author to define the amount of value m. The best result, i.e. the
seed, i.e. the seed of generator. But in our at- length of sequence, is obtained by using prime
tempt to achieve the utter control of a random numbers (Knuth, 1997).
a)
b)
Figure 5. a) portrait font, the original version and b) a version processed by algorithm
74
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
Using the available generator within a pro- An individual test of pseudorandom se-
gramming language (random, math. random, quence in the Processing language:
rand...) the same sequence of numbers is always
// congruent method of
obtained because of their pseudo character. In
generating random numbers
the attempt to get diverse results, except for
control, independent generators are needed to float a = 2311;
create the rhythm and add new interventions float m = 914189; //the
into the existing graphics. In computer graph- biggest number
ics, random number generators are used for
float s = 913373; //sjeme
different purposes (for colours, dimensions,
angles…) that do not have the same occurrence int i;
period; and that period can also be random. In float rn;
order to control the parameters of newly intro- float f;
duced segments of programs, we need to ensure
the same sequences at the previous pseudo ran- //for the range
dom sequences. The only way to obtain com- float x1 = -5;
pletely controlled solutions is introducing a few float x2 = 5;
independent pseudo random generators. All
for (i=1; i<50; i++)
our generators have a range from 0 to 1, but each
one has a different initiator. {
s = (a*s) %m;
The numbers in Table 1 leads to the conclu-
//the range from 0 to 1
sion that the length of the sequence obtained
by a congruent method depends on the choice rn= s/m;
of numbers. Better results are achieved using f = rn * (x2-x1)+x1;
prime numbers (especially for ‘a’ and ‘m’); how- println(f);
ever that is not the only factor determining a
generator’s efficiency. }
Table 1: examples of generators and their efficiency in relation to the selected numbers
a S m Sequence length %
7 13 23 10 43
37 19 23 22 95
7 13 24 3 12
2311 41077 96553 32184 33
2311 913373 914189 228546 24
2311 41077 96558 66 0,1
2311 101 37313 9328 25
67 101 193 32 16
401 101 193 192 99
5431 3373 7547 7546 99
5431 3374 7547 5071 67
5431 3373 7542 1254 16
9 25 31 15 48
9 31 73 6 8
9 277 439 73 16
9 53 439 73 16
9 53 331 165 50
227 53 331 330 99
227 56 331 330 99
75
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
The backbone of this animation are letters ments in the shape of lines. New screening ele-
from the Streetvertizing font (http://www.clean- ments can already result from the graphic itself
vertising.com/) and Processing library Geomera- and do not have to be created from screening
tive (http://www.generative-gestaltung.de), cells. The example showing solutions to the
used to transfer font characters into a certain glyph already proves that there is a new field of
number of curves, i.e. segments. Afterwards, the screening technology. Dissipation and multipli-
end points of these curves are used as starting cation of these screening elements resolves the
points of new graphic elements, in this instance problem of Moire in its own way, if the same let-
lines. The target (finishing point) of these lines ter were interpreted in multicoloured print. In
is determined using an own random number order to achieve, for instance, a brown hue of
generator and by each pass through the loop, the graphic 6th letter, a 6/6 would preset a yellow
the letter starts to be drawn again, but the num- channel, letter a 6/4 a magenta channel, letter
ber range that the generator uses is in each pass a 6/3 a cyan channel. Channel K would not be
bigger, resulting thus in the greater length of needed. The same principle is used in the spot
lines and bigger angles compared to the start- multicolour system pairing each colour with
ing point. Two independent generators are used, its own solution. The length of pseudo random
one for the x and the other for the y axis. The generator determining the coverage, and the
animation shows alterations of one parameter in seed is different for various channels in order to
this graphic, and that is the range of numbers of prevent the repetition of the same graphic posi-
the random number generator. tions in various channels. Similarly to the way in
which these examples generate a screening ele-
These algorithms for generating graphic ele- ment as a part of a straight line, this discussion
ments are targeted at the new area of defining can be expanded to any other graphic element,
screening technology. The example of a lower such as a square, an ellipsis, an arc, a circle or a
case letter ‘a’ shows coverage with microele- Bézier curve.
76
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
Graphic technology is based on solving cov- ing and human behaviour has also changed.
erage through various mathematical screening Programming enables the obtaining of a series
methods. The artists from the age of the earliest of images by changing parameters that can lead
computer graphics were the first to come across to animations. New methods of expression such
the problem. The creation of new screening el- as music or words can be generated by comput-
ements for solving coverage is based on com- ers and in that way they expand the forms of ex-
puter graphics developed in 1960s. After the use pression. The acceptance of new methods does
of cameras in reprographics (and net screen- not threaten the “classical” art techniques, but it
ing) was abandoned, all technology of solving develops new functions of stimulating creative
coverage and screening problems was derived capacities and sensitizing viewpoints. In com-
from computer graphics. The focus was placed parison with traditional techniques, computer
on finding new solutions in design and solving offers a different approach and generates results
problems of graphic reproduction by means of emphasizing cognitive processes, creativity and
computer methods. imagination rather than physical skills and tal-
ent. Printing technology has introduced math-
ematical definitions of screening elements. Au-
thors of those programs have suggested many
procedures and forms based on PostScript de-
5. Conclusion scription of screening cells. We have presented
a proposition of screening using simple math-
in its beginnings, computer graphics were ematical forms. Screening solutions of early
based on geometrical and mathematical forms computer graphics were compared which no
and were therefore losing support of critics and analogue mathematical interpretation was pos-
audiences. Those beginnings provoked the de- sible for. Preconditions for the systematisation
velopment of unknown spheres of graphically of screening elements as a basis for new forms
attractive forms, i.e. new aesthetic area that does have been created.
not even have to be named art. The way of think-
77
Turčić et al.: Individual stochastic screening..., acta graphica 22(2011)3-4, 69-78
References
Moles, A., 1968, Introduction, Kelemen, B. Nake, F., 1970, “Statement for PAGE” , PAGE
Putar, R. eds. Bit Interantional 3, Interna- 8 bulletin of the computer arts society, may
tional Colloquium on Computers and Vis- 1970, Gustav Metzger ed., London Available
ual Research, Zagreb August 3-4 1968, pp at: <http://www.bbk.ac.uk/hosted/cache/
3-10, Zagreb: Galerije grada Zagreba archive/PAGE/PAGE8%20May%201970.
pdf> [Accessed 3 August 2011]
78