Algorithm_closestpair
  • 10:16,
  • 972 views,
  • 2017-12-27,
  • 上傳者: 系統管理者,
  •  0
 
 
 
  • 1. The Closest Pair Problem
  • 2. The Closest Pair Problem
  • 3. Slide 3
  • 4. The algorithm:Input: A set S of n planar points.Output: The distance between two closest points. Step 1: Sort points in S according to their y-values.Step 2: If S contains only one point, return infinity as its distance.Step 3: Find a median line L perpen
  • 5. Step 5: For a point P in the half-slab bounded by L-d and L, let its y-value be denoted as yP . For each such P, find all points in the half-slab bounded by L and L+d whose y-value fall within yP+d and yP-d. If the distance d between P and a point in t
1/5
Volume
  • 速度 :
  • 畫質 :
  • 播放設定
00:00/10:16
00:00/00:28
 
 
    訪客如要回應,請先 登入
      解析度 : x
      資料夾 :
      發表時間 :
      2017-12-27 06:06:42
      觀看數 :
      972
      長度 :
      10:16
      發表人 :
      系統管理者
      部門 :
      www
      QR Code :