This is a problem from Courant:
Two straight lines entirely outside the given sheet of paper are each given by two pairs of straight lines intersecting at points of the lines outside the paper. Determine their point of intersection by a pair of lines through it.
Using Brianchon's theorem the solution (with all the lines/points on the paper) is: The two lines can be regarded as two of the three concurrent diagonals of the theorem. From the intersecting two pairs of lines a third concurrent diagonal can be constructed for each line. These two diagonals intersect in the point of intersection of the two original lines. However, for this construction you need all intersection points, don't you? Any idea? Or different approach?






Define a “virtual point” $\tilde P$ to be a point, possibly off the paper, represented by a pair of lines $l, m$ on the paper passing through it. Define a “virtual line” $\tilde l$ to be a line, possibly off the paper, represented by a pair of virtual points $\tilde P, \tilde Q$ lying on it. We wish to prove that given two virtual lines $\tilde l, \tilde m$, we can construct their virtual point of intersection $\tilde A = \tilde l ∩ \tilde m$.
We’ll use Pappus’s hexagon theorem to prove three increasingly powerful lemmas, as follows.
Lemma 1. Given point $P$ and virtual point $\tilde Q$, we can construct the line $P\tilde Q$.
Proof. Say $\tilde Q$ is represented by $l, m$. Choose arbitrary points $B, E$. Draw $A = BP ∩ l$, $C = AE ∩ m$, $D = EP ∩ m$, $F = BD ∩ l$, $R = BC ∩ EF$, and $PR$. By Pappus’s theorem on hexagon $ABCDEF$, $P, \tilde Q, R$ are collinear, so $P\tilde Q = PR$.
If $P$ is on some line that intersects both $l, m$ on the paper, then by choosing $B, E$ sufficiently close to that line, we can perform this construction entirely on the paper. If not, we can instead perform it with an arbitrary $P'$ that is on such a line, yielding an auxiliary line concurrent with $l, m$, and repeat until we have auxiliary lines $l', m'$ suitable for the construction with $P$. □
Lemma 2. Given line $l$ and virtual line $\tilde m$, we can construct the virtual point $l ∩ \tilde m$.
Proof. Say $\tilde m$ is represented by $\tilde P, \tilde Q$. Choose arbitrary point $A$ and points $C, D$ on $l$. Using lemma 1, construct lines $A\tilde P, C\tilde Q, D\tilde P$, then let $E = AC ∩ D\tilde P$ and construct $E\tilde Q$. Draw $B = A\tilde P ∩ C\tilde Q$, $F = BD ∩ E\tilde Q$, and $AF$. By Pappus’s theorem on hexagon $ABCDEF$, the points $\tilde P, \tilde Q, l ∩ AF$ are collinear, so $l ∩ \tilde m$ is represented by $l, AF$.
We can always choose $A$ is sufficiently close to $l$ and $C, D$ on $l$ sufficiently close to $A$ that we can perform this construction entirely on the paper. □
Lemma 3. Given point $P$ and two virtual lines $\tilde l, \tilde m$, we can construct the line through $P$ concurrent with $\tilde l, \tilde m$.
Proof. Choose arbitrary points $B, E$. Using lemma 2, construct virtual points $\tilde A = BP ∩ \tilde l$, $\tilde C = AE ∩ \tilde m$, $\tilde D = EP ∩ \tilde m$, $\tilde F = BD ∩ \tilde l$. Using lemma 1, construct lines $B\tilde C$ and $E\tilde F$. Draw $R = B\tilde C ∩ E\tilde F$, and $PR$. By Pappus’s theorem on hexagon $\tilde AB\tilde C\tilde DE\tilde F$, $P, \tilde l ∩ \tilde m, R$ are collinear, so $PR$ is concurrent with $\tilde l, \tilde m$.
We can always choose $B, E$ sufficiently close to $P$ that we can perform this construction entirely on the paper. □
Theorem. Given two virtual lines $\tilde l, \tilde m$, we can construct the virtual point $\tilde l ∩ \tilde m$.
Proof. Choose two arbitrary points $P, Q$. Using lemma 3, construct lines $n$ through $P$ and $o$ through $Q$ concurrent with $\tilde l, \tilde m$. Then $\tilde l ∩ \tilde m$ is represented by $n, o$. □