首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than f

Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than f

  • 资源大小:3 K
  • 上传时间:2022-06-19
  • 下载次数:0次
  • 浏览次数:1次
  • 资源积分:1积分
  • 标      签: contains Output convex planar

资 源 简 介

Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP
0.252275s