> The numbers p and q should not be "too close", lest the Fermat factorization for n be successful. If p − q is less than 2n^{1/4} (n = p⋅q, which even for "small" 1024-bit values of n is 3×10^{77}), solving for p and q is trivial. Furthermore, if either p − 1 or q − 1 has only small prime factors, n can be factored quickly by Pollard's p − 1 algorithm, and hence such values of p or q should be discarded.
Wikipedia is not always right, and certainly shouldn't be trusted implicitly on details in depth, but it's an interesting thing for them to be saying.
If you take it to an extreme, using a prime p of the form 2^k+1 makes pq reasonably easy to factor (I think) using the Pollard P-1 algorithm.
So there's still value in ensuring that p-1 and q-1 both have a reasonably large factor.
But I'm at, and possibly beyond, my actual knowledge, and somewhat into "better safe than sorry" speculation.
> with the current factorization technology, the advantage of using safe and strong primes appears to be negligible
(I'm not an expert either.)