Java - Calculate all pairs positions distance of multi-vectors

Question

Suppose I have 5 lists different lenths that contain positions (2D points). I need to calculate distances of all pairs of points possible between these 5 lists in order to filter the pairs that have distance smaller than a threshold, e.g., 10.

A naive approach is making loops, over every points of every list, and verify if there is a pair that have distance smaller 10.

for position in list1
   for position in list2
      for position in list3
         for position in list4
            for position in list5
               list all pairs possible of 5 positions
               calculate distance of each pair
               if (distance < threshold):
                  add pair positions in final result

This approach has exponential complexity when I add more new list of position.

Another approach is instead of making a loop of 5 lists, I create 10 loops of all possible 2 lists (2-combination of 5 lists). So if I add more new list, the complexity will increase following the number of combination (not exponential) but I'm still not happy with that.

Is there anyway to calculate all pairs distance of multi-lists in linear complexity ? Thanks