Synopses & Reviews
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.
Table of Contents
Director's Preface. Introduction. The Power of Positive Thinking; W. Chan et al. Introduction to Chow Forms; J. Dalbec, B. Sturmfels. Capelli's Method of Variabili Ausiliarie, Superalgebras, and Geometric Calculus; A. Brini, A. Teolis. Letterplace Algebra and Symmetric Functions; W. Chan. A Tutorial on Grassmann-Cayley Algebra; N. White. Computational Symbolic Geometry; B. Mourrain, N. Stolfi. Invariant Theory and the Projective Plane; M. Hawrylycz. Automatic Proving of Geometric Theorems; H. Crapo, J. Richter- Gebert. The Resolving Bracket; H. Crapo, G.-C. Rota. Computation of the Invariants of a Point Set in P3 from its Projection in P2; L. Quan. Geometric Algebra and Möbius Sphere Geometry as a Basis for Euclidean Invariant Theory; T. Havel. Invariants on G/U × G/U × G/U = SL(4,C); F. Grosshans. On a Certain Complex Related to the Notion of Hyperdeterminant; G. Boffi. On Cayley's Projective Configurations - An Algorithmic Study; R. San Augustin. On the Construction of Equifacetted 3-Spheres; J. Bokowski. Depths and Betti Numbers of Homology Manifolds; C. Chan et al. Index.