Combinatorial and Discrete Geometry

MATH243 (Liberal Arts) Combinatorial and Discrete Geometry 3 hrs. 3 crs. A survey of Euclidean and non-Euclidean geometrical ideas primarily from a non-metrucak oersoectuve, Axiom systems. Distance functions. Basic topics in the theory of graphs; trees, planarity, networks, coloring problems, and Euler's polyhedral formula. Basic topics in convexity, discrete, and computational geometry: Helly's theroem, curves of constant breadth, the Sylvester-Gallai theorem, and Veronoi diagrams. Preq: MATH 122. Not open to students with credit in MATH 241.