On the $N$-set occupancy problem

We explore variants of the following open question: Split $[0,1]^2$ into $N^2$ squares with side length $1/N$. Is there a way to select $N$ such squares such that each line intersects only $O(1)$ of them?