Invariant Methods In Discrete And Computational Geometry

Invariant, or coordinate-free methods provide a natural framework for many geometric questions. Invariant Methods in Discrete and Computational Geometry provides a basic introduction to several aspects of invariant theory, including the supersymmetric algebra, the Grassmann-Cayler algebra, and Chow forms. It also presents a number of current research papers on invariant theory and its applications to problems in geometry, such as automated theorem proving and computer vision.
Audience: Researchers studying mathematics, computers and robotics.

Invariant, or coordinate-free methods provide a natural framework for many geometric questions. Invariant Methods in Discrete and Computational Geometry provides a basic introduction to several aspects of invariant theory, including the supersymmetric algebra, the Grassmann-Cayler algebra, and Chow forms. It also presents a number of current research papers on invariant theory and its applications to problems in geometry, such as automated theorem proving and computer vision.
Audience: Researchers studying mathematics, computers and robotics.

Booknews

The 16 papers provide a basic introduction to several aspects of invariant theory, including the super-symmetric algebra, the Grannmann-Cayley algebra, and Chow forms. Invariant, or coordinate-free, methods are a natural framework for many geometric questions. They also include current research papers on the theory and its applications to such geometry problems as automated theorem proving and computer vision. Other topics include a complex related to the notion of hyper-determinants, the construction of equifacetted 3-spheres, the resolving bracket, and geometric algebra and Mobius sphere geometry as a basis for Euclidean invariant theory. Annotation c. Book News, Inc., Portland, OR (booknews.com)