Meet and Join
- Outer product almost gives smallest super-space
- Problem: gives 0 if common subspace
- Conceptually, there are operators meet and join
that compute largest common subspace and smallest super-space
- Problem: precise definition is tricky
- With meet and join, we can write line intersect line routine that
handles degeneracies
- Point
- Line
- Closest distance between line
No conditions in line intersect line code