Before revision:  For the case of lines in 3-space we present an improved implementation, whose running time is O(n^{4/3}  n).
After revision:  For the case of lines in 3-space we present an improved implementation, whose running time is O(n^{4/3} \log^{O(1) n).