Computing triangulations using oriented matroids
Oriented matroids are a suitable interface between calculations in coordinates and computations in combinatorial geometry. This paper surveys a selection of efficient combinatorial methods to compute triangulations of a point configuration, which depend only on its oriented matroids. The authors present the most important ingredients necessary to exploit oriented matroids as a data structure for computing all triangulations of a point configuration and report on experience with an implementation of these concepts in the software package TOPCOM. Finally, they calculate some examples illustrating how these tools (the construction of the secondary polytope of a point configuration) were integrated into the POLYMAKE framework. For the entire collection see [Zbl 1008.00013].
- Spatial graphs and oriented matroids: The trefoil
- Circuit admissible triangulations of oriented matroids
- Parallel enumeration of triangulations
- TOPCOM
- Complete enumeration of small realizable oriented matroids
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- scientific article; zbMATH DE number 994740 (Why is no real title available?)
- Triangulations of Oriented Matroids and Convex Polytopes
- scientific article; zbMATH DE number 3867356 (Why is no real title available?)
- The hyperdeterminant and triangulations of the 4-cube
- A construction of isomorphism classes of oriented matroids
- scientific article; zbMATH DE number 1860735 (Why is no real title available?)
- Efficient edge-skeleton computation for polytopes defined by oracles
- Amplituhedron meets Jeffrey–Kirwan residue
- Webs of stars or how to triangulate free sums of point configurations
This page was built for publication: Computing triangulations using oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418121)
