Discrete Geometry
Discrete geometry is a branch of mathematics that studies geometric objects combinatorially or discretely. There are lots of applications in both pure mathematics and computer science, such as data visualization, computer graphics, robotics, etc. In this course, we will focus on surveying some key themes in discrete geometry, with a strong emphasis on studying concrete examples that can be visualized. Topics may include polygons (triangulations, Pick's Theorem, scissors congruence), convex Polytopes (basic properties, lattice polytopes, lattice point enumeration), Voronoi diagrams.