Incorporate in a graphics package (even Matlab is ok) to display the output.
Using this statement, show that the nearest neighbor graph of P can be computed in O(n log n) time.
Make your bound as simple as possible.
Note for grading: this homework is graded
into three dimensional scores (f,b,c) where each score is 0--5, 5 is highest, and
f: the formulation score, 5 for correct formulation.
b: for simplication and estimation.
c: for meaningful experiment.