sudgylacmoe | Calculating the Invariant Decomposition in 3D PGA @sudgylacmoe | Uploaded September 2024 | Updated October 2024, 4 hours ago.
Last week I talked about how bivectors in 3D PGA can be written as the sum of a line in space and the line at infinity around that line. But how do you actually calculate these two lines given an arbitrary bivector? A general algorithm for doing this was found recently in Roelf and De Keninck's paper "Graded Symmetry Groups: Plane and Simple", and while the general algorithm is too complicated for a short, I present the special case of the algorithm for 3D PGA.
Discord: discord.gg/3Zj59zA2Rg
Patreon: patreon.com/sudgylacmoe
Supporters:
David Johnston
Jason Killian
jerrud
Richard Penner
trb
Last week I talked about how bivectors in 3D PGA can be written as the sum of a line in space and the line at infinity around that line. But how do you actually calculate these two lines given an arbitrary bivector? A general algorithm for doing this was found recently in Roelf and De Keninck's paper "Graded Symmetry Groups: Plane and Simple", and while the general algorithm is too complicated for a short, I present the special case of the algorithm for 3D PGA.
Discord: discord.gg/3Zj59zA2Rg
Patreon: patreon.com/sudgylacmoe
Supporters:
David Johnston
Jason Killian
jerrud
Richard Penner
trb