Nt1310 Unit 2 Assignment 3

95 Words1 Page

Let C=¹C1, C2, .... ,Cn º be a set of unit disks stored in an array C of size n. Each element Ci 2C stores the coordinate of its center ci = ¹ , º. We study and implement an algorithm for computing the largest clique size in the intersection graph G = ¹V,Eº of a set of unit disks can be made in-place. Here the vertices in G correspond to the members in C,¹Ci,Cj º 2 E if and only if the disks Ci and Cj intersect, ie, the distance d¹ci, cj º

More about Nt1310 Unit 2 Assignment 3

Open Document