浙江大学 算法和程序设计 计算几何.pptVIP

Computational Geometry Instructor: yedeshi yedeshi@ Computational Geometry Algorithms for geometric problems Applications: CAD, GIS, computervision,……. E.g., the closest pair problem: Given: a set of points P={p1… pn} in the plane, such that pi=(xi,yi) Goal: find a pair pi ≠pj that minimizes ||pi –pj||, where ||p-q||= [(px-qx)2+(py-qy)2]1/2 Line-segment A convex combination of two distinct points p1 = (x1, y1) and p2 = (x2, y2) is any point p3 = (x3, y3) such that for some α in the range 0 ≤ α ≤ 1, we have x3 = αx1 + (1 - α)x2 and y3 = αy1 + (1 - α)y2. Also, p3 = αp1 + (1 - α)p2. Line segment: Given two distinct points p1 and p2, the line segment is the set of convex combinations of p1 and p2. We call p1 and p2 the endpoints of segment Sometimes the ordering of p1 and p2 matters, and we speak of the directed segment Cross products Computing cross products is at the heart of our line-segment methods Consider vectors p1 and p2 : The cross product p1 × p2 can be interpreted as the signed area of the parallelogram formed by the points (0, 0), p1, p2, and p1 + p2 = (x1 + x2, y1 + y2). Cross product An equivalent, but more useful, definition gives the cross product as the determinant of a matrix Cross product If p1 × p2 is positive, then p1 is clockwise from p2 with respect to the origin (0, 0); If it is negative, then p1 is counterclockwise from p2 Boundary condition: cross product is 0; in this case, the vectors are collinear, pointing in either the same or opposite directions. clockwise To determine whether a directed segment is clockwise from a directed segment ? Compute (p1 - p0) × (p2 - p0) = (x1 - x0)(y2 - y0) - (x2 - x0)(y1 - y0). Two line segments intersect Determine whether two line segments intersect, we check whether each segment straddles the line containing the other. A segment straddles a line if point p1 lies on one side of the line and point p2 lies on the other s