4. The 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:
5. Divide-and-Conquer for Maxima Finding
6. The 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:
4. The 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:
5. Divide-and-Conquer for Maxima Finding
6. The 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:
Prev