Computing vanishing points (from lines)
v
q2
q1
p2
p1
Intersect p1q1 with p2q2
Least squares version
Better to use more than two lines and compute the “closest” point of
intersection
See notes by Bob Collins for one good way of doing this:
http://www-2.cs.cmu.edu/~ph/869/www/notes/vanishing.txt