A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P.
One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
標(biāo)簽：
polygon
S.
the
contains
上傳時(shí)間：
2013-12-23
上傳用戶(hù)：it男一枚
