Polyhedral Computation Interface
Symbolic (analytical) polyhedron projection by Fourier-Motzkin elimination using SymPy
Fourier-Motzkin Elimination Method for Polyhedral Projection
Algorithms for finding tight UTVPI (octagonal) over-approximations of polyhedra using linear programming and Fourier-Motzkin elimination
FMB algorithm implementation to perform intersection detection of pairs of static/dynamic cuboid/tetrahedron in 2D/3D by using the Fourier-Motzkin elimination method
A C-implementation of Fourier-Motzkin elimination
Implementation of the Fourier-Motzkin algorithm in C++. Fourier–Motzkin elimination is a algorithm for eliminating variables from a system of linear inequalities. In practice it is used e.g. for deciding if a set is non-empty
Add a description, image, and links to the fourier-motzkin-elimination topic page so that developers can more easily learn about it.
To associate your repository with the fourier-motzkin-elimination topic, visit your repo's landing page and select "manage topics."