© 1995

Invariant Methods in Discrete and Computational Geometry

Proceedings of the Curaçao Conference, 13–17 June, 1994

  • Neil L. White

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Wendy Chan, Gian-Carlo Rota, Joel A. Stein
    Pages 1-36
  3. John Dalbec, Bernd Sturmfels
    Pages 37-58
  4. Neil L. White
    Pages 93-106
  5. B. Mourrain, N. Stolfi
    Pages 107-139
  6. Michael Hawrylycz
    Pages 141-166
  7. Henry Crapo, Jürgen Richter-Gebert
    Pages 167-196
  8. Henry Crapo, Gian-Carlo Rota
    Pages 197-222
  9. Frank D. Grosshans
    Pages 257-277
  10. Jürgen Bokowski
    Pages 301-312
  11. Clara S. Chan, Douglas Jungreis, Richard Stong
    Pages 313-321
  12. Back Matter
    Pages 323-328

About this book


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.


Symbol algorithms automated theorem proving computational geometry computer computer vision geometry robotics

Editors and affiliations

  • Neil L. White
    • 1
  1. 1.Mathematics DepartmentUniversity of FloridaGainesvilleUSA

Bibliographic information