Closest pair of points

[mfornet]

In the Closest pair of points algorithm we should recover closest pair.

[gilcu3]

In a recent problem (brazil's Endagorion geometry contest I think) I saw that divide&conquer implementation is at least one order of magnitude faster, although a bit longer code, do you think it would be useful to use that algorithm instead?
http://codeforces.com/group/3qadGzUdR4/contest/101707/submission/34488424
http://codeforces.com/group/3qadGzUdR4/contest/101707/submission/34519736