Abstract
Every vector space with an inner product has a geometric algebra, whether or not you choose to use it. This article shows how to call on this structure to define common geometrical constructs, ensuring a consistent computational framework. The goal is to show you that this can be done and that it is compact, directly computational, and transcends the dimensionality of subspaces. We do not use geometric algebra to develop new algorithms for graphics, but hope to demonstrate that one can automatically take care of some of the lower level algorithmic aspects, without tricks, exceptions, or hidden degenerate cases by using geometric algebra as a language.

This publication has 5 references indexed in Scilit: