Abstract
Using conformal geometric algebra, Euclidean motions in n-D are represented as orthogonal transformations of a representational space of two extra dimensions, and a well-chosen metric. Orthogonal transformations are representable as multiple reflections, and by means of the geometric product this takes an efficient and structure preserving form as a ‘sandwiching product’. The antisymmetric part of the geometric product produces a spanning operation that permits the construction of lines, planes, spheres and tangents from vectors, and since the sandwiching operation distributes over this construction, ‘objects’ are fully integrated with ‘motions’. Duality and the logarithms complete the computational techniques.
The resulting geometric algebra incorporates general conformal transformations and can be implemented to run almost as efficiently as classical homogeneous coordinates. It thus becomes a high-level programming language which naturally integrates quantitative computation with the automatic administration of geometric data structures.
This appendix provides a concise introduction to these ideas and techniques. Editorial note: This appendix is a slightly improved version of (Dorst in: Bayro-Corrochano, E., Scheuermann, G. (eds.) Geometric Algebra Computing for Engineering and Computer Science, pp. 457–476, [2011]). We provide it to make this book more self-contained.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We have simplified slightly; the general representation of a point at x in CGA is a scalar multiple of x in (21.1); the scalar factor is the scalar −n ∞⋅x (as you may verify), and this can be consistently interpreted as the weight of the point. The squared distance between weighted points is computed by normalizing first as (x/(−n ∞⋅x))⋅(y/(−n ∞⋅y)). Euclidean transformations should then not affect this formula; this implies that they are the specific orthogonal transformations that preserve the special vector n ∞.
- 2.
- 3.
References
Doran, C., Lasenby, A.: Geometric Algebra for Physicists. Cambridge University Press, Cambridge (2000)
Dorst, L.: Tutorial: Structure preserving representation of Euclidean motions through conformal geometric algebra. In: Bayro-Corrochano, E., Scheuermann, G. (eds.) Geometric Algebra Computing for Engineering and Computer Science, pp. 457–476. Springer, Berlin (2011)
Dorst, L., Fontijne, D., Mann, S.: Geometric Algebra for Computer Science: An Object-Oriented Approach to Geometry. Morgan Kaufman, San Mateo (2007/2009). See www.geometricalgebra.net
Fontijne, D.: Efficient Implementation of Geometric Algebra. University of Amsterdam, Amsterdam (2007), ISBN: 13 978-90-889-10-142, online at www.science.uva.nl/~fontijne
Hestenes, D., Rockwood, A., Li, H.: System for encoding and manipulating models of objects. U.S. Patent 6,853,964, February 8, 2005
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dorst, L. (2011). Tutorial Appendix: Structure Preserving Representation of Euclidean Motions Through Conformal Geometric Algebra. In: Dorst, L., Lasenby, J. (eds) Guide to Geometric Algebra in Practice. Springer, London. https://doi.org/10.1007/978-0-85729-811-9_21
Download citation
DOI: https://doi.org/10.1007/978-0-85729-811-9_21
Publisher Name: Springer, London
Print ISBN: 978-0-85729-810-2
Online ISBN: 978-0-85729-811-9
eBook Packages: Computer ScienceComputer Science (R0)