Path coverings of two sets of points in the plane

We consider the following problem: For given two sets of red points and blue points in the plane respectively, we want to cover all these points with disjoint non-crossing alternating geometric paths of the same length. Determine the length of a path for which the above covering always exists under a trivial necessary condition on the numbers of red points and blue points. We give a complete solution to this problem.