Algorithms in invariant theory
Algorithms in invariant theory
Generalized homogeneous coordinates for computational geometry
Geometric computing with Clifford algebras
Journal of Symbolic Computation
Journal of Symbolic Computation
Symbolic computation in the homogeneous geometric model with clifford algebra
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |
Miquel's Five-Circle Theorem is difficult to prove algebraically. In this paper, the details of the first algebraic proof of this theorem is provided. The proof is based on conformal geometric algebra and its accompanying invariant algebra called null bracket algebra, and is the outcome of the powerful computational techniques of null bracket algebra embodying the novel idea breefs.