Title:

Computer Art

Code:VIN
Ac.Year:2017/2018
Term:Winter
Curriculums:
ProgrammeBranchYearDuty
IT-MSC-2MBI-Elective
IT-MSC-2MBS-Elective
IT-MSC-2MGM1stElective
IT-MSC-2MIS-Elective
IT-MSC-2MMI-Elective
IT-MSC-2MMM-Elective
IT-MSC-2MPV-Elective
IT-MSC-2MSK-Elective
Language:Czech
Credits:5
Completion:classified accreditation
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:2600026
 ExaminationTestsExercisesLaboratoriesOther
Points:0000100
Guarantee:Čadík Martin, doc. Ing., Ph.D., DCGM
Lecturer:Staudek Tomáš, Mgr., Ph.D., DCGM
Faculty:Faculty of Information Technology BUT
Department:Department of Computer Graphics and Multimedia FIT BUT
Schedule:
DayLessonWeekRoomStartEndLect.Gr.St.G.EndG.
WedlecturelecturesD020618:0019:501MITxxxx
WedlecturelecturesD020618:0019:502MITxxxx
 
Learning objectives:
  The aim of the course (http://artgorithms.droppages.com) is to get acquainted with the principles of mathematics and computer science in the artistic fields, to understand theoretical foundations of algorithmic creativity and software aesthetics, to get an overview of applied computer art, to apply practical skills from the field of software aesthetics, realizeand criticize artistic creations with the aid of computer.
Description:
  In this course we explore the places where art, mathematics and algorithms meet. The course consists of introduction into computer art, computer-aided creativity in the context of generalized aesthetics, a brief history of the computer art, aesthetically productive functions (periodic functions, cyclic functions, spiral curves, superformula), creative algorithms with random parameters (generators of pseudo-random numbers with different distributions, generator combinations), context-free graphics and creative automata, geometric substitutions (iterated transformations, graftals), aesthetically productive proportions (golden section in mathematics and arts), fractal graphics (dynamics of a complex plane, 3D projections of quaternions, Lindenmayer rewriting grammars, space-filling curves, iterated affine transformation systems, terrain modeling etc.), chaotic attractors (differential equations), mathematical knots (topology, graphs, spatial transformations), periodic tiling (symmetry groups, friezes, rosettes, interlocking ornaments), non-periodic tiling (hierarchical, spiral, aperiodic mosaics), exact aesthetics (beauty in numbers, mathematical appraisal of proportions, composition and aesthetic information). The course is lectured by Tomáš Staudek.
Knowledge and skills required for the course:
  The course assumes creative mind, artistic thinking, basic mathematical knowledge, basic knowledge of computer graphics principles.
Learning outcomes and competences:
  
  • Students will acquire theoretical and applied competence in software aesthetics.
  • Students will be able to interpret and evaluate algorithmic works of art.
  • Students will deepen creative skills by fulfilling practical graphic assignments.
Syllabus of lectures:
 
  1. Towards mathematical art: art in the 20th and 21st centuries.
  2. Software aesthetics: visual forms of computer art.
  3. History of computer art: from the oscilloscope to interactive media.
  4. Aesthetic functions: from sinus and cosinus to the superformula.
  5. Aesthetic transformations: repetition, parametrization and rhythm of algorithms.
  6. Aesthetic proportions: golden section in mathematics, art and design.
  7. Spirals and graftals: models of growth and branching in nature.
  8. Geometric fractals: iterated functions and space-filling curves.
  9. Algebraic fractals: from the complex plane to higher dimensions.
  10. Chaotic fractals: visual chaos of strange attractors.
  11. Symmetry and ornament: periodic tiling and interlocking mosaics.
  12. Nonperiodic and special ornament: spiral, hyperbolic and aperiodic mosaics.
  13. Mathematical knots: knots and braids from the Celts to modern topology.
Syllabus - others, projects and individual work of students:
 
Creative assignments follow the lecture topics and are realized in a form of non-supervised projects supported by freely available creative applications for each topic. Outputs will be exhibited in the students' gallery.
  1. Letterism and ASCII art
  2. Digital improvisation
  3. Computer-aided rollage
  4. Generated graphics
  5. Quantized functions
  6. Algorithmic op-art
  7. Evolutionary algorithms
  8. Chaotic attractors
  9. Context-free graphics
  10. Fractal flames
  11. Quaternion fractals
  12. Fractal landscape
  13. Escher's tiling
  14. Islamic ornament
  15. Circle limit mosaics
  16. Knotting
  17. Digital collage
  18. Graphic poster
  19. Artistic image stylization
  20. Generated sculpture
Fundamental literature:
 
  • Bruter, C. P.: Mathematics and Art. Springer Verlag, 2002.
  • Caplan, C. S. The Bridges Archive. The Bridges Organization, 2013. 
  • Emmer, M., ed.: Mathematics and Culture II: Visual Perfection. Mathematics and Creativity. Springer Verlag, 2005.
  • Emmer, M., ed.: The Visual Mind II. The MIT Press, 2005.
  • Friedman, N., Akleman, E.: HYPERSEEING. The International Society of the Arts, Mathematics, and Architecture (ISAMA), 2012. 
  • Kapraff, J.: Connections: The Geometric Bridge Between Art and Science. World Scientific Publishing Company; 2nd edition, 2002.
  • Manovich, L.: Software Takes Command. Bloomsbury Academic, 2013.
  • McCormack, J., et al.: Ten Questions Concerning Generative Computer Art. Leonardo: Journal of Arts, Sciences and Technology, 2012.
  • Peterson, I.: Fragments of Infinity: A Kaleidoscope of Math and Art. John Wiley & Sons, 2001.
  • Radovic, L.: VisMath. Mathematical Institute SASA, Belgrade, 2014.
Study literature:
 
  • Adams, C. C.: The Knot Book. Freeman, New York, 1994.
  • Barnsley, M.: Fractals Everywhere. Academic Press, Inc., 1988.
  • Bentley, P. J.: Evolutionary Design by Computers.Morgan Kaufmann, 1999.
  • Deussen, O., Lintermann, B.: Digital Design of Nature: Computer Generated Plants and Organics.X.media.publishing, Springer-Verlag, Berlin, 2005.
  • Glasner, A. S.: Frieze Groups. In: IEEE Computer Graphics & Applications, pp. 78-83, 1996.
  • Grünbaum, B., Shephard, G. C.: Tilings and Patterns. W. H. Freeman, San Francisco, 1987.
  • Livingstone, C.: Knot Theory. The Mathematical Association of America, Washington D.C., 1993.
  • Lord, E. A., Wilson, C. B.: The Mathematical Description of Shape and Form. John Wiley & Sons, 1984.
  • Mandelbrot, B.: The Fractal Geometry of Nature. W. H. Freeman, New York - San Francisco, 1982.
  • Moon, F.: Chaotic and Fractal Dynamics. Springer-Verlag, New York, 1990.
  • Ngo, D. C. L et al. Aesthetic Measure for Assessing Graphic Screens. In: Journal of Information Science and Engineering, No. 16, 2000.
  • Peitgen, H. O., Richter, P. H.: The Beauty of Fractals. Springer-Verlag, Berlin, 1986.
  • Pickover, C. A.: Computers, Pattern, Chaos and Beauty. St. Martin's Press, New York, 1991.
  • Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer-Verlag, New York, 1990.
  • Schattschneider, D.: Visions of Symmetry (Notebooks, Periodic Drawings, and Related Work of M. C. Escher). W. H. Freeman & Co., New York, 1990.
  • Sequin, C. H.: Procedural Generation of Geometric Objects. University of California Press, Berkeley, CA, 1999.
  • Spalter, A. M.: The Computer in the Visual Arts. Addison Weslley Professional, 1999.
  • Stiny, G., Gips, J.: Algorithmic Aesthetics; Computer Models for Criticism and Design in the Arts. University of California Press, 1978.
  • Todd, S., Latham, W.: Evolutionary Art and Computers.Academic Press Inc., 1992.
  • Turnet, J. C., van der Griend, P. (eds.): History and Science of Knots. World Scientific, London, 1995.
Controlled instruction:
  The monitored teaching activities include lectures, creative assignments, and the final project in a form of a creative graphics application. Classes are supported by elearning activities in LMS Schoology. Students are responsible for reading and watching provided materials and participating in class discussions.
Assignments are provided in the form of individually elaborated projects. The classified credit has two possible correction terms.
Progress assessment:
  Creative assignments -- up to 50 points (at least 10 evaluated pieces by 5 points):
  • 3 points: technical realization and aesthetic quality
  • 1 point: exhibition in the course gallery
  • 1 point: timely submission
Final project -- up to 50 points (creative graphics application):
  • 15 points: concept originality
  • 20 points: programming intensity
  • 15 points: interface quality
Exam prerequisites:
  The final grade corresponds to the points earned during the semester. Students will pass the course after accomplishing half of assignments (50 points). Final project (another 50 points) consists from creating an application for artistic creativity and presenting its creative potential. The application shall be executable on an appropriate platform (Win, OSX, iOS, Linux, Android). Extra points can be attributed for class activity.