class sign-up
|
50: A Heuristic Introduction to Computational Geometry
|
|---|
|
This course discusses common problems/patterns/solutions in computational geometry and how they are useful for artists. Topics include delaunay triangulation, voronoi diagrams, largest empty circle, patterning, map problems, and generally all the hot topics in comp geom, topology, and graph theory explained using everyday language and using simple methods for calculating each. [ offer to teach this ] |