To find the maximum number of points of intersection of pairs of lines from the given set, we need to consider how the lines are arranged based on the given conditions.

Firstly, there are 10 lines (${L}_1, {L}_3, ..., {L}_{19}$) that are parallel to each other. Since parallel lines do not intersect with each other, these 10 lines will not contribute to the number of intersection points among themselves.

Secondly, there are 10 lines (${L}_2, {L}_4, ..., {L}_{20}$) that all pass through a given point $P$. Although these lines intersect at $P$, they only contribute one unique point of intersection to the total count.

To calculate the maximum number of intersection points, we need to consider the total number of ways to pick pairs of lines from the 20 lines available without restrictions, then subtract the combinations that do not result in intersections, which includes the combinations of parallel lines among themselves and the concurrent lines through point $P$.

This calculation is represented as:

$$Total = ^{20}C_2 - ^{10}C_2 - ^{10}C_2 + 1$$

Here, $^{20}C_2$ calculates the total number of ways to pick any two lines out of 20, which includes intersecting and non-intersecting lines. $^{10}C_2$ is subtracted twice: once for the set of parallel lines (${L}_1, {L}_3, ..., {L}_{19}$) that don't intersect among themselves and once more for the set of concurrent lines (${L}_2, {L}_4, ..., {L}_{20}$) intersecting only at point $P$. Since all the concurrent lines intersect at the same point, we add 1 back to include this intersection point.

Carrying out this calculation gives us the total number of distinct intersection points as $101$.