{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_closestpair","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/963f854c5aaa0137\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare957' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/957' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"10:16","index":{"item_1":{"title":"The Closest Pair Problem","time":"0","indent":"0","sn":"1"},"item_2":{"title":"The Closest Pair Problem","time":"28470","indent":"0","sn":"2"},"item_3":{"title":"Slide 3","time":"210320","indent":"0","sn":"3"},"item_4":{"title":"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","time":"280070","indent":"0","sn":"4"},"item_5":{"title":"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\uf0a2 between P and a point in t","time":"441070","indent":"0","sn":"5"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/963f854c5aaa0137\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/963f854c5aaa0137\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/963f854c5aaa0137\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/9\/963f854c5aaa0137","status":true}