title: Efficient way to compute coincidence of space and time
body: <p>Given a 3-dimensional polyline <code>P = {(x1, y1, t1), ..., (xn, yn, tn)}</code> and another polyline <code>Q = {(x1, y1, t1), ..., (xm, ym, tm)}</code> (m not necessarly equal to n, so polylines could have different length), coincidence in space and time occurs when the trajectories of moving objects P and Q, have some timing and positioning in common (Point A, as seen in example figure is a coincidence point cause <code>(xa, ya, ta)==(xb, yb, tb)</code> obviously coincidence point could be a point outside of initial sets of point)
  <img src="https://i.stack.imgur.com/qSnhF.png" alt="coincidence in space and time">
  The concept is quite simple and visual perspective easily identify where colocation happen. Hardest part is how to realize an algorithm that efficiently compute coincidence and return the calculated (remember: point could be outside given sets of points) x, y coords and time t of where colocation happens!! This algorithm will be developed in Matlab so I have all necessary to rapidly work.</p>
  
  <p>Best regards</p>