Do you have anything resembling reason to add as to why points cannot completely cover a line?
Yes.
Look how simply is understood by this little game:
For this game we need two points, a line and a plane.
Let the plan be the screen itself.
Now we locate two arbitrary points on the screen and call them point A and point B, as follows:
.A B.
Point A can be simultaneously at most at one location.
Point B can be simultaneously at most at one location.
Now add the line to the game, as follows:
A B
The line can be simultaneously at least at location A AND at location B.
Being simultaneously at least at location A AND at location B is possible in this case, because the line has a non-local property.
Being simultaneously at most at one location is the best that we can get from a point, because a point has local property.
It does not matter how infinitely many scale levels are defined (they can be also uncountable infinitely many), the non-local property of the line is not vanished, and so is the local property of the points.
If you understand this little game, then you immediately and unconditionally understand that a line can't completely be covered by points even if the collection of points is complete (no point is missing).
By understanding this beautiful fact, you also immediately and unconditionally understand that a line has a degree of infinity which is strictly greater than any given collection of points along it.
The same holds among any collection of given dimensions, such that:
The infinity of a line is strictly greater than the infinity of collection of points.
The infinity of a plan is strictly greater than the infinity of collections of lines and points.
Etc …
Fullness (that has no successor), which is the opposite of Emptiness (that has no predecessor), has the greatest infinity, which is grater than any collection of dimensional spaces even if this collection has uncountable infinitely many dimensions.