1.0Camdemy1.0http://media.usc.edu.twAlgorithm_2dmaxfindinghttp://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/e/e573a40845de185d/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare956' frameborder='0' src='http://media.usc.edu.tw/media/e/956' allowfullscreen></iframe>video72040511:322-D Maxima Finding Problem012-D Maxima Finding Problem02Divide-and-Conquer for Maxima Finding03The algorithm:Input: A set S of n planar points.Output: The maximal points of S.Step 1: If S contains only one point, return it as the maxima. Otherwise, find a line L perpendicular to the X-axis which separates S into SLand SR, with equal sizes.Step 2: 04Divide-and-Conquer for Maxima Finding05The algorithm:Input: A set S of n planar points.Output: The maximal points of S.Step 1: If S contains only one point, return it as the maxima. Otherwise, find a line L perpendicular to the X-axis which separates S into SLand SR, with equal sizes.Step 2: 06Slide 907fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/e/e573a40845de185d/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/e/e573a40845de185d/cover.jpghttp://media.usc.edu.tw/sysdata/doc/e/e573a40845de185d/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/e/e573a40845de185d1