|Hour/sem||Lectures||Sem. Exercises||Lab. exercises||Comp. exercises||Other|
|Guarantee:||Zemčík Pavel, prof. Dr. Ing., DCGM|
|Lecturer:||Staudek Tomáš, Mgr., Ph.D., DCGM|
|Faculty:||Faculty of Information Technology BUT|
|Department:||Department of Computer Graphics and Multimedia FIT BUT|
To get acquainted with the principles of informatics, get also acquainted with the examples, to learn practical skills from the field of artistic informatics, get acquainted with the history and future of "Computer Art", practically realize some artistic creations.
Introduction in "Computer Art", brief history of "Computer Art" in the World and in the Czech Republic, aesthetically productive periodical functions (trigonometrical functions, cycloides, etc.), chaotic attractors (differential equations), geometrical substitutions (iterations of transformations), artistic algorithms with random parameters (generators of pseudo-random numbers with different distributions, combinations of generators), fractal graphics (dynamics in complex variable, 3D slices of quaternions, Lindenmayer rewriting grammars, systems of affine equations, etc.), mosaics periodical, non-periodical (groups of symmetry, graphs, grammars), decorative nodes (topology and graphs), artistic processing of raster image (monadic and dyadic operations, convolution filters, morphing, warping, etc.), special drawing and other functions (NPR algorithms), exact aesthetics (numerical aesthetics by Birkhoff, Bense, etc.), future of "Computer Art".
|Knowledge and skills required for the course:|
Basic knowledge of manipulation with computer and basic knowledge of computer graphics principles.
|Learning outcomes and competences:|
The students will get acquainted with the principles of informatics and with the examples, they will learn some practical skills from the field of artistic informatics, they will also get acquainted with the history and future of "Computer Art", finally, they will practically realize some artistic creations.
|Syllabus of lectures:|
- Introduction in "Computer Art". motivation
- History of Computer Art
- Aesthetically productive algorithms
- Periodical functions
- Chaotic attractors
- Fractal graphics I
- Fractal graphics II
- Decorative nodes
- Artistic processing of raster image I
- Artistic processing of raster image II
- NPR systems
- Future of Computer Art
|Syllabus of computer exercises:|
The themes of excercises follow exactly the lecture topics (demonstration programs for each topic is available).|
|Syllabus - others, projects and individual work of students:|
Individually assigned projects.|
- Peitgen, H. O., Saupe D. eds.: The Science of Fractal Images. Springer Verlag, New York, 1989, ISBN 0-387-96608-0
- Todd, S., Latham, W.: Evolutionary Art and Computers. ISBN 0-12-437185-X
- Lord, E. A., Wilson, C. B.: The Mathematical Description of Shape and Form. John Wiley & Sons, New York 1984
- Barnsley, M.: Fractals Everywhere. Academic Press, Inc., Boston, New York, 1988, ISBN:0-12-079062-9
- Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer-Verlag, New York 1990
- Stiny, G., Gips, J.: Algorithmic Aesthetics; Computer Models for Criticism and Design in the Arts. University of California Press, 1978
The monitored teaching activities include test, individual project, and final exam. The test does not have correction option while the final exam has two possible correction terms.
- Test - up to 10 points
- Project - up to 40 points
- Final exam - up to 50 points