Computational Oriented Matroids: Equivalence Classes of Matrices within a Natural Framework

Oriented matroids play the role of matrices in discrete geometry, when metrical properties, such as angles or distances, are neither required nor available. Thus they are of great use in such areas as graph theory, combinatorial optimization and convex geometry. The combination of concrete applications and computation, the profusion of illustrations, many in color, and the large number of examples and exercises make this an ideal introductory text on the subject. It will also be valuable for self-study for mathematicians and computer scientists working in discrete and computational geometry.