亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

您現在的位置是:蟲蟲下載站 > 資源下載 > 數學計算 > 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-23
  • 上傳用戶: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.

相 關 資 源

主站蜘蛛池模板: 虞城县| 凉城县| 潮州市| 泽普县| 寿宁县| 赤水市| 康马县| 缙云县| 苏尼特右旗| 安庆市| 汽车| 永城市| 商水县| 泰兴市| 鞍山市| 治多县| 青川县| 建湖县| 谷城县| 芜湖市| 汽车| 潼关县| 朔州市| 舒兰市| 枞阳县| 乾安县| 柳江县| 宿州市| 闸北区| 穆棱市| 宜丰县| 八宿县| 伊吾县| 清苑县| 沙坪坝区| 鹤山市| 兖州市| 区。| 蓬莱市| 龙游县| 丰镇市|