(计算机图形学)lecture2Computational Geometry 2D Convex Hulls教学讲义.pptVIP

Computational Geometry2D Convex Hulls Joseph S. B. Mitchell Stony Brook University Comparing O(n), O(n log n), O(n2) 2 n n log n n² 210 10³ 10 • 210  104 220  106 220  106 20 • 220  2 • 107 240 1012 Interactive Processing n log n algorithms n² algorithms n = 1000 yes ? n = 1000000 ? no Function T(n) is O(f(n)) if there exists a constant C such that , for sufficiently large n, T(n) C f(n) Convexity Set X is convex if p,qX  pq X Point p X is an extreme point if there exists a line (hyperplane) through p such that all other points of X lie strictly to one side Fact: If X=S is a finite set of points in 2D, then CH(X) is a convex polygon whose vertices (extreme points) are points of S. 3 p q r Extreme points in red Equivalent Definitions of Convex Hull, CH(X) Set-theoretic “smallest” convex set containing X. {all convex combinations of d+1 points of X } [Caratheodory’s Thm] (in any dimension d) In 2D: min-area (or min-perimeter) enclosing convex body containing X In 2D: 4 Convexity Fact: If X=S is a finite set of points in 2D, then CH(X) is a convex polygon whose vertices (extreme points) are points of S. 5 p4 p1 p3 p6 p5 p8 p7 p9 Primitive Computation “Left” tests: sign of a cross product (determinant), which determines the orientation of 3 points Time O(1) (“constant”) 8 a b c Left( a, b, c ) = TRUE  ab  ac 0 c is left of ab SuperStupidCH: O(n4) Fact: If s ∆pqr, then s is not a vertex of CH(S)  p  q  p  r  p,q  s  p,q,r: If s  ∆pqr then mark s as NON-vertex Output: Vertices of CH(S) Can sort (O(n log n) ) to get ordered 9 O(n3) O(n) s p q r StupidCH: O(n3) Fact: If all points of S lie strictly to one side of the line pq or lie in between p and q, then pq is an edge of CH(S).  p  q  p  r  p,q: If r  red then mark pq as NON-edge (ccw) Output: Edges of CH(S) Can sort (O(n log n) ) to get ordered 10 O(n2) O(n) Caution!! Nu