A Geometric Algebra Implementation using Binary Tree - Archive ouverte HAL Access content directly
Journal Articles Advances in Applied Clifford Algebras Year : 2017

A Geometric Algebra Implementation using Binary Tree


This paper presents an efficient implementation of geometric algebra, based on a recursive representation of the algebra elements using binary trees. The proposed approach consists in restructuring a state of the art recursive algorithm to handle parallel optimizations. The resulting algorithm is described for the outer product and the geometric product. The proposed implementation is usable for any dimensions, including high dimension (e.g. algebra of dimension 15). The method is compared with the main state of the art geometric algebra implementations , with a time complexity study as well as a practical benchmark. The tests show that our implementation is at least as fast as the main geometric algebra implementations.
Fichier principal
Vignette du fichier
breuils_aaca_2016.pdf (312.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01510078 , version 1 (19-04-2017)
hal-01510078 , version 2 (03-05-2017)



Stéphane Breuils, Vincent Nozick, Laurent Fuchs. A Geometric Algebra Implementation using Binary Tree. Advances in Applied Clifford Algebras, 2017, 1, pp.1-19. ⟨10.1007/s00006-017-0770-6⟩. ⟨hal-01510078v2⟩
421 View
7724 Download



Gmail Facebook Twitter LinkedIn More