figure voronoi diagram give an ( log nalgorithm to find one such arrangement your algorithm may serve as proof for part ( we are given set pn of points in plane voronoi diagram is partition of the plane into regions ri such that all points in ri are closer to pi than any other point in figure shows sample voronoi diagram for seven (nicely arrangedpoints give an ( log nalgorithm to construct the voronoi diagram convex polygon is polygon with the property that any line segment whose endpoints are on the polygon lies entirely within the polygon the convex hull problem consists of finding the smallest (areaconvex polygon that encloses set of points in the plane figure shows the convex hull for set of points give an ( log nalgorithm to find the convex hull figure example of convex hull