1.0Camdemy1.0http://media.usc.edu.twAlgorithm_closestpairhttp://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/9/963f854c5aaa0137/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare957' frameborder='0' src='http://media.usc.edu.tw/media/e/957' allowfullscreen></iframe>video72040510:16The Closest Pair Problem01The Closest Pair Problem02Slide 303The 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 perpen04Step 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 t05fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/9/963f854c5aaa0137/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/9/963f854c5aaa0137/cover.jpghttp://media.usc.edu.tw/sysdata/doc/9/963f854c5aaa0137/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/9/963f854c5aaa01371