LECTURE ---> Fractal Geometry: Algorithms and Beauty Poster by Dmytro Strapchev

LECTURE ---> Fractal Geometry: Algorithms and Beauty

Join us for an open lecture by Stefano Cavagnetto which illustrates some of the ideas underpinning work by Prague College staff and students this semester across the disciplines of art and computing. Prague College Studios | Polska 26 Thursday, January 28 Starts at 6:30 pm The main aim of this talk is to illustrate how algorithms effectively generate an amazing world of fractals. Classical Euclidean geometry deals with objects which exist in integer dimensions; fractal geometry works with objects in non-integer dimensions. While Euclidean geometry is a description of lines, curves, ellipses, etc. fractal geometry is described in algorithms, i.e. set of instructions. These set of instructions might produce rough or fragmented geometric shapes that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole (Mandelbrot, 1982). The overall process gives rise to an unexpected beauty which can be depicted by beautiful shapes.