Are you interested in mathematics and algorithms in computer graphics? Are you thinking about signing up for ANI-DVG (Introduction to Discrete and Computational Geometry)? Come to a lecture on Sweep Line Algorithms. Šimon Taněv will introduce you to the general concept and three specific algorithms: Line Segment Intersections, Voronoi Diagram Construction, and Visibility Graph Construction.