Finding self-intersections of 2D movement paths (efficiently)

Question

Set-up: I have movement paths of an agent defined by the x,y,t coordinates of the left and right edges of it, so a 6-element vector. I\'m dealing with 1000+