Combinatorial Geometry
Download as PDF
Overview
Subject area
MATH
Catalog Number
243
Course Title
Combinatorial Geometry
Department(s)
Description
A survey of Euclidean and non-Euclidean geometrical ideas primarily from a non-metric perspective. 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 theorem, curves of constant breadth, the Sylvester-Gallai theorem, and Voronoi diagrams.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
3
Repeat For Credit
No
Components
Name
Lecture
Hours
3
Requisites
014926