Computational Oriented Matroids: Equivalence Classes of Matrices within a Natural Frameworkby Juergen G. Bokowski
Pub. Date: 03/31/2006
Publisher: Cambridge University Press
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.
- Cambridge University Press
- Publication date:
- Edition description:
- New Edition
- Product dimensions:
- 6.85(w) x 9.72(h) x 0.98(d)
Table of Contents1. Geometric matrix models i; 2. Geometric matrix models ii; 3. From matrices to rank 3 oriented matroids; 4. Oriented matroids of arbitrary rank; 5. From oriented matroids to face lattices; 6. From face lattices to oriented matroids i; 7. From face lattices to oriented matroids ii; 8. From oriented matroids to matrices; 9. Computational synthetic geometry; 10. Some oriented matroid applications; 11. Some inttrinsic oriented matroid problems; Bibliography; Index.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >