Clipping algorithms are the basis of most computer graphics book.
IMHO Cohen–Sutherland is quite straight forward...
Nota bene: you need spherical geometry to calculate "lines" (great circles) connecting "corners". But then it's the same principle.
Latitudes are not the shortest connections between 2 points!!!
Cheers Rolf
In reply to Re^3: Permutation and comparison loop
by LanX
in thread Permutation and comparison loop
by spacegeologist
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |