Question: Suppose, for a data approximation application, you are given a set of n points in the plane and you would like to partition these points
Suppose, for a data approximation application, you are given a set of n points in the plane and you would like to partition these points into two sets, A and B, such that each point in A is as close or closer to another point in A than it is to any point in B, and vice versa. Describe an efficient algorithm for doing this partitioning.
Step by Step Solution
3.51 Rating (161 Votes )
There are 3 Steps involved in it
Construct a graph G having the n points as its vertices and th... View full answer
Get step-by-step solutions from verified subject matter experts
