(计算机图形学)lecture1What is CG.ppt

* * * * * * * * * * * * * * WUSTL applet * * * * * * * * * * * * * * Computational Geometry Lecture 1: Introduction Joe Mitchell Background Geometry: vectors, dot/cross product AMS301: Counting, graphs, recursion Permutations, combinations Planar graphs, DFS, Euler F(n) = 2F(n/2) + Cn Solve: F(n)=O(n log n) Algorithms: read/parse a C program, big-Oh notation (O(n), O(n log n), O(n2), O(n log n)) What is CG? The algorithmic and mathematical study of efficient methods to solve geometric problems Example 1 Point-in-polygon test: Is point q inside simple polygon P? P n-gon q N