虫虫首页|资源下载|资源专辑|精品软件
登录|注册

您现在的位置是:虫虫下载站 > 资源下载 > 数学计算 > A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is

A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is

  • 资源大小:13 K
  • 上传时间: 2013-12-22
  • 上传用户:wujiahui1pm
  • 资源积分:2 下载积分
  • 标      签: polygon S. the contains

资 源 简 介

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.

相 关 资 源