Given a correctly defined list of points and a list of lines :
Can Pandas find all the lines that join any pair of points and not cross any of the given lines without iteration?
Im currently reaching a solution, as you can see in the image, but I have to repeat this process, and this iteration makes everything very slow.
In the image, the list of points is the highlighted colored points, and the list of lines is the candlesticks. Desired result - black lines.
, , , , , , : http://pastebin.com/4DiKVy26
Pandas, , , , . , , , ; m n m (m-1)/2 , 2n : m * (m-1) * n = > . .
, , raycasting ( , 2d): ; , . , , . ; x , , y . , . , , ; . , . m * (m-1)/2 + m * n, .