首页| 行业标准| 论文文档| 电子资料| 图纸模型
购买积分 购买会员 激活码充值

您现在的位置是:团子下载站 > 其他 > 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
  • 上传时间:2021-04-02
  • 下载次数:0次
  • 浏览次数:39次
  • 资源积分: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