News for hackers. Stuff that matters.
Re:Programmer’s guide to homogeneous coordinates by theoh on Monday May 15, 2017 @10:32AM (#14341856)
Those two operations are called "meet" and "join", and in principle they work with any linear subspaces (point, line, plane, etc.) So the meet of a line and a plane in 3D is a point, the join of a point and a line in 3D is a plane, etc.

Wikipedia is good on this stuff if you are patient with mathematician's way of expressing things...

https://en.m.wikipedia.org/wiki/Join_and_meet

https://en.m.wikipedia.org/wiki/Linear_subspace

"Lattice of subspaces

The operations intersection and sum make the set of all subspaces a bounded modular lattice, where the {0} subspace, the least element, is an identity element of the sum operation, and the identical subspace V, the greatest element, is an identity element of the intersection operation."

Re:Programmer’s guide to homogeneous coordinates by tel on Thursday May 18, 2017 @12:42PM (#14368728)
Then you can go full geometric algebra and base your whole geometry on this latticez