亚洲欧美第一页_禁久久精品乱码_粉嫩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.

相 關 資 源

主站蜘蛛池模板: 长乐市| 吕梁市| 班玛县| 遂川县| 宜兰市| 合肥市| 宝坻区| 名山县| 广东省| 齐齐哈尔市| 曲靖市| 萨嘎县| 灵宝市| 韩城市| 论坛| 墨玉县| 济南市| 通许县| 江西省| 丹阳市| 新巴尔虎左旗| 永川市| 体育| 筠连县| 新疆| 仁怀市| 封开县| 凉山| 峨眉山市| 广德县| 石泉县| 龙井市| 赣榆县| 东港市| 海口市| 噶尔县| 桑植县| 武乡县| 响水县| 西林县| 老河口市|