Question: You are given N circles, with ith represented by coordinates of centre as xi,yi and radius ri(all circles lie on the xy plane). The task is to remove minimum number of circles such that the remaining circles do not overlap or touch each other.
Note: Ci, Cj are overlapping is the distance between their centre points <=ri+rj.
First line contains N
The next N lines contains three integers xi,yi,ri.
0 0 3
2 0 3
4 0 3
Any help in algo or idea is appreciated. Thanks in Advance.